/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:27:24,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:27:24,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:27:24,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:27:24,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:27:24,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:27:24,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:27:24,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:27:24,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:27:24,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:27:24,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:27:24,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:27:24,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:27:24,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:27:24,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:27:24,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:27:24,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:27:24,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:27:24,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:27:24,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:27:24,618 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:27:24,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:27:24,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:27:24,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:27:24,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:27:24,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:27:24,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:27:24,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:27:24,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:27:24,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:27:24,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:27:24,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:27:24,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:27:24,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:27:24,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:27:24,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:27:24,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:27:24,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:27:24,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:27:24,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:27:24,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:27:24,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:27:24,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:27:24,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:27:24,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:27:24,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:27:24,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:27:24,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:27:24,652 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:27:24,652 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:27:24,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:27:24,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:27:24,653 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:27:24,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:27:24,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:27:24,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:27:24,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:27:24,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:27:24,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:27:24,654 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 15:27:24,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:27:24,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:27:24,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:27:24,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:27:24,912 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:27:24,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c [2022-04-08 15:27:24,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836936864/b7fea869a7ba4444872598003bc7aa39/FLAG6990e4ab3 [2022-04-08 15:27:25,507 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:27:25,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c [2022-04-08 15:27:25,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836936864/b7fea869a7ba4444872598003bc7aa39/FLAG6990e4ab3 [2022-04-08 15:27:25,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/836936864/b7fea869a7ba4444872598003bc7aa39 [2022-04-08 15:27:25,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:27:25,991 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:27:25,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:27:25,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:27:25,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:27:26,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:27:25" (1/1) ... [2022-04-08 15:27:26,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7087ba1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26, skipping insertion in model container [2022-04-08 15:27:26,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:27:25" (1/1) ... [2022-04-08 15:27:26,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:27:26,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:27:26,419 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.13.i.cil-2.c[74353,74366] [2022-04-08 15:27:26,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:27:26,451 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:27:26,576 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.13.i.cil-2.c[74353,74366] [2022-04-08 15:27:26,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:27:26,593 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:27:26,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26 WrapperNode [2022-04-08 15:27:26,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:27:26,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:27:26,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:27:26,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:27:26,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:27:26,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:27:26,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:27:26,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:27:26,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (1/1) ... [2022-04-08 15:27:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:27:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:27:26,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 15:27:26,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 15:27:26,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:27:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:27:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:27:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-08 15:27:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-08 15:27:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:27:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-08 15:27:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:27:26,826 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:27:26,827 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:27:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:27:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:27:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:27:26,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:27:26,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:27:26,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:27:26,971 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:27:26,973 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:27:27,662 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:27:28,240 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-08 15:27:28,240 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-08 15:27:28,252 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:27:28,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:27:28,266 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:27:28,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:27:28 BoogieIcfgContainer [2022-04-08 15:27:28,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:27:28,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:27:28,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:27:28,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:27:28,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:27:25" (1/3) ... [2022-04-08 15:27:28,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150d521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:27:28, skipping insertion in model container [2022-04-08 15:27:28,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:27:26" (2/3) ... [2022-04-08 15:27:28,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2150d521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:27:28, skipping insertion in model container [2022-04-08 15:27:28,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:27:28" (3/3) ... [2022-04-08 15:27:28,279 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2022-04-08 15:27:28,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:27:28,284 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:27:28,328 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:27:28,346 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 15:27:28,346 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:27:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 15:27:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 15:27:28,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:28,380 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] [2022-04-08 15:27:28,381 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:28,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 1 times [2022-04-08 15:27:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:28,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743631011] [2022-04-08 15:27:28,405 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:27:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 2 times [2022-04-08 15:27:28,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:28,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593774850] [2022-04-08 15:27:28,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:28,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:28,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 15:27:28,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 15:27:28,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-08 15:27:28,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:28,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-08 15:27:28,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-08 15:27:28,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-08 15:27:28,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-08 15:27:28,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-08 15:27:28,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {161#true} is VALID [2022-04-08 15:27:28,926 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-08 15:27:28,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,939 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,941 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:28,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-08 15:27:28,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-08 15:27:28,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {162#false} is VALID [2022-04-08 15:27:28,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {162#false} is VALID [2022-04-08 15:27:28,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-08 15:27:28,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {162#false} is VALID [2022-04-08 15:27:28,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-08 15:27:28,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-08 15:27:28,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-08 15:27:28,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-08 15:27:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:27:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:28,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593774850] [2022-04-08 15:27:28,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593774850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:28,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:28,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:28,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:28,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743631011] [2022-04-08 15:27:28,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743631011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:28,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:28,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77884459] [2022-04-08 15:27:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 15:27:28,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:28,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:29,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:29,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:29,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:29,091 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:32,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:35,611 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-08 15:27:39,569 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-08 15:27:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:43,997 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-08 15:27:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-08 15:27:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-08 15:27:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-08 15:27:44,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-08 15:27:44,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:44,666 INFO L225 Difference]: With dead ends: 430 [2022-04-08 15:27:44,666 INFO L226 Difference]: Without dead ends: 261 [2022-04-08 15:27:44,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:44,672 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:44,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-08 15:27:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-08 15:27:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-08 15:27:44,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:44,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,715 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,716 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:44,729 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-08 15:27:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-08 15:27:44,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:44,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:44,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-08 15:27:44,733 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-08 15:27:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:44,746 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-08 15:27:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-08 15:27:44,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:44,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:44,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:44,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-08 15:27:44,757 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-08 15:27:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:44,757 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-08 15:27:44,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:44,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-08 15:27:44,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-08 15:27:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 15:27:44,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:44,995 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] [2022-04-08 15:27:44,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:27:44,995 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:44,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 1 times [2022-04-08 15:27:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:44,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796867829] [2022-04-08 15:27:44,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:27:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 2 times [2022-04-08 15:27:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:44,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057067285] [2022-04-08 15:27:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:45,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-08 15:27:45,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 15:27:45,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-08 15:27:45,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:45,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-08 15:27:45,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 15:27:45,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-08 15:27:45,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret161 := main(); {1895#true} is VALID [2022-04-08 15:27:45,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1895#true} is VALID [2022-04-08 15:27:45,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1895#true} is VALID [2022-04-08 15:27:45,280 INFO L272 TraceCheckUtils]: 7: Hoare triple {1895#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1895#true} is VALID [2022-04-08 15:27:45,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:27:45,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1901#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-08 15:27:45,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {1901#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1896#false} is VALID [2022-04-08 15:27:45,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {1896#false} is VALID [2022-04-08 15:27:45,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {1896#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {1896#false} is VALID [2022-04-08 15:27:45,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {1896#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1896#false} is VALID [2022-04-08 15:27:45,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {1896#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {1896#false} is VALID [2022-04-08 15:27:45,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {1896#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1896#false} is VALID [2022-04-08 15:27:45,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {1896#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1896#false} is VALID [2022-04-08 15:27:45,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#false} assume 8 == ~blastFlag~0; {1896#false} is VALID [2022-04-08 15:27:45,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-08 15:27:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:27:45,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:45,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057067285] [2022-04-08 15:27:45,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057067285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:45,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:45,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:45,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:45,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796867829] [2022-04-08 15:27:45,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796867829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:45,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:45,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047761746] [2022-04-08 15:27:45,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:45,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 15:27:45,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:45,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:45,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:45,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:45,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:45,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:45,347 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:47,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:51,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:27:53,518 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-08 15:27:55,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-08 15:27:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:57,126 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-08 15:27:57,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:27:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-08 15:27:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:27:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:27:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:27:57,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-08 15:27:57,581 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-08 15:27:57,598 INFO L225 Difference]: With dead ends: 444 [2022-04-08 15:27:57,598 INFO L226 Difference]: Without dead ends: 289 [2022-04-08 15:27:57,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:27:57,600 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:27:57,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2022-04-08 15:27:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-08 15:27:57,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-08 15:27:57,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:27:57,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,618 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,618 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:57,636 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-08 15:27:57,636 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-08 15:27:57,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:57,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:57,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-08 15:27:57,638 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-08 15:27:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:27:57,655 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-08 15:27:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-08 15:27:57,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:27:57,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:27:57,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:27:57,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:27:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-08 15:27:57,674 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-08 15:27:57,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:27:57,675 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-08 15:27:57,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:27:57,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-08 15:27:57,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:27:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-08 15:27:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 15:27:57,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:27:57,908 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-08 15:27:57,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:27:57,908 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:27:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:27:57,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2016462011, now seen corresponding path program 1 times [2022-04-08 15:27:57,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:57,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845953468] [2022-04-08 15:27:57,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:27:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2016462011, now seen corresponding path program 2 times [2022-04-08 15:27:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:27:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024626417] [2022-04-08 15:27:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:27:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:27:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:58,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:27:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:27:58,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-08 15:27:58,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 15:27:58,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-08 15:27:58,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:27:58,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-08 15:27:58,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-08 15:27:58,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-08 15:27:58,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret161 := main(); {3771#true} is VALID [2022-04-08 15:27:58,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3771#true} is VALID [2022-04-08 15:27:58,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3771#true} is VALID [2022-04-08 15:27:58,129 INFO L272 TraceCheckUtils]: 7: Hoare triple {3771#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3771#true} is VALID [2022-04-08 15:27:58,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,148 INFO L290 TraceCheckUtils]: 21: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,148 INFO L290 TraceCheckUtils]: 22: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,157 INFO L290 TraceCheckUtils]: 38: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-08 15:27:58,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3777#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-08 15:27:58,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {3777#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3772#false} is VALID [2022-04-08 15:27:58,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {3772#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3772#false} is VALID [2022-04-08 15:27:58,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {3772#false} assume 4 == ~blastFlag~0; {3772#false} is VALID [2022-04-08 15:27:58,165 INFO L290 TraceCheckUtils]: 47: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-08 15:27:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:27:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:27:58,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024626417] [2022-04-08 15:27:58,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024626417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:58,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:58,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:58,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:27:58,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845953468] [2022-04-08 15:27:58,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845953468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:27:58,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:27:58,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:27:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090850197] [2022-04-08 15:27:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:27:58,168 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-08 15:27:58,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:27:58,168 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-08 15:27:58,216 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-08 15:27:58,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:27:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:27:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:27:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:27:58,217 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. 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-08 15:28:00,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:01,549 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-08 15:28:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:01,550 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-08 15:28:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:01,550 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-08 15:28:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:28:01,556 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-08 15:28:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-08 15:28:01,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-08 15:28:01,998 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-08 15:28:02,020 INFO L225 Difference]: With dead ends: 503 [2022-04-08 15:28:02,020 INFO L226 Difference]: Without dead ends: 319 [2022-04-08 15:28:02,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-08 15:28:02,028 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:02,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 344 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 477 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:28:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-08 15:28:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-08 15:28:02,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:02,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:02,055 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:02,055 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:02,063 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-08 15:28:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-08 15:28:02,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:02,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:02,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-08 15:28:02,066 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-08 15:28:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:02,075 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-08 15:28:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-08 15:28:02,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:02,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:02,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:02,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-08 15:28:02,083 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-08 15:28:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:02,084 INFO L478 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-08 15:28:02,084 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-08 15:28:02,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-08 15:28:02,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-08 15:28:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 15:28:02,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:02,367 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-08 15:28:02,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:28:02,367 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1906852389, now seen corresponding path program 1 times [2022-04-08 15:28:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:02,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [164754485] [2022-04-08 15:28:02,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:28:02,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1906852389, now seen corresponding path program 2 times [2022-04-08 15:28:02,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:02,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757531822] [2022-04-08 15:28:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:02,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:02,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-08 15:28:02,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-08 15:28:02,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-08 15:28:02,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {5905#true} call ULTIMATE.init(); {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:02,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-08 15:28:02,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-08 15:28:02,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-08 15:28:02,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {5905#true} call #t~ret161 := main(); {5905#true} is VALID [2022-04-08 15:28:02,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5905#true} is VALID [2022-04-08 15:28:02,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5905#true} is VALID [2022-04-08 15:28:02,520 INFO L272 TraceCheckUtils]: 7: Hoare triple {5905#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5905#true} is VALID [2022-04-08 15:28:02,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {5905#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:02,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5911#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-08 15:28:02,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {5911#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,531 INFO L290 TraceCheckUtils]: 30: Hoare triple {5906#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {5906#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {5906#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {5906#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {5906#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {5906#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {5906#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,532 INFO L290 TraceCheckUtils]: 37: Hoare triple {5906#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {5906#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {5906#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {5906#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {5906#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-08 15:28:02,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume 8641 == #t~mem76;havoc #t~mem76; {5906#false} is VALID [2022-04-08 15:28:02,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5906#false} is VALID [2022-04-08 15:28:02,534 INFO L290 TraceCheckUtils]: 47: Hoare triple {5906#false} assume 4 == ~blastFlag~0; {5906#false} is VALID [2022-04-08 15:28:02,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-04-08 15:28:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:28:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:02,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757531822] [2022-04-08 15:28:02,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757531822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:02,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:02,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:02,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:02,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [164754485] [2022-04-08 15:28:02,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [164754485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:02,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:02,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073154819] [2022-04-08 15:28:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:02,536 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-08 15:28:02,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:02,537 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-08 15:28:02,579 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-08 15:28:02,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:02,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:02,581 INFO L87 Difference]: Start difference. First operand 239 states and 388 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-08 15:28:04,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:08,007 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-08 15:28:11,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:13,138 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-08 15:28:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:13,138 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-08 15:28:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:13,138 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-08 15:28:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 15:28:13,142 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-08 15:28:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-08 15:28:13,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-08 15:28:13,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:13,522 INFO L225 Difference]: With dead ends: 491 [2022-04-08 15:28:13,523 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 15:28:13,523 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:13,524 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:13,525 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 365 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 15:28:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 15:28:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-08 15:28:13,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:13,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:13,541 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:13,542 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:13,548 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-08 15:28:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-08 15:28:13,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:13,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:13,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:28:13,550 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:28:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:13,556 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-08 15:28:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-08 15:28:13,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:13,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:13,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:13,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-08 15:28:13,564 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 49 [2022-04-08 15:28:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:13,564 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-08 15:28:13,564 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-08 15:28:13,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-08 15:28:13,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-08 15:28:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 15:28:13,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:13,871 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-08 15:28:13,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:28:13,871 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1091716454, now seen corresponding path program 1 times [2022-04-08 15:28:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:13,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117334039] [2022-04-08 15:28:13,898 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:13,898 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1091716454, now seen corresponding path program 2 times [2022-04-08 15:28:13,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:13,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809733337] [2022-04-08 15:28:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:13,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:14,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7933#true} is VALID [2022-04-08 15:28:14,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-08 15:28:14,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-08 15:28:14,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:14,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7933#true} is VALID [2022-04-08 15:28:14,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-08 15:28:14,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-08 15:28:14,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret161 := main(); {7933#true} is VALID [2022-04-08 15:28:14,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7933#true} is VALID [2022-04-08 15:28:14,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {7933#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7933#true} is VALID [2022-04-08 15:28:14,040 INFO L272 TraceCheckUtils]: 7: Hoare triple {7933#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7933#true} is VALID [2022-04-08 15:28:14,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {7933#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,051 INFO L290 TraceCheckUtils]: 18: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:14,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7939#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-08 15:28:14,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {7939#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7934#false} is VALID [2022-04-08 15:28:14,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 24: Hoare triple {7934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} ~skip~0 := 0; {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {7934#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {7934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {7934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {7934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {7934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {7934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {7934#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {7934#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {7934#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {7934#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {7934#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {7934#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {7934#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {7934#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {7934#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {7934#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {7934#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {7934#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {7934#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {7934#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {7934#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {7934#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 51: Hoare triple {7934#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {7934#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,056 INFO L290 TraceCheckUtils]: 53: Hoare triple {7934#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {7934#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {7934#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {7934#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 57: Hoare triple {7934#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 58: Hoare triple {7934#false} assume 8641 == #t~mem76;havoc #t~mem76; {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 59: Hoare triple {7934#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 60: Hoare triple {7934#false} assume 4 == ~blastFlag~0; {7934#false} is VALID [2022-04-08 15:28:14,057 INFO L290 TraceCheckUtils]: 61: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-08 15:28:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:28:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809733337] [2022-04-08 15:28:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809733337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:14,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:14,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:14,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:14,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117334039] [2022-04-08 15:28:14,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117334039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:14,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:14,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881976768] [2022-04-08 15:28:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:14,060 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-08 15:28:14,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:14,060 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-08 15:28:14,111 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-08 15:28:14,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:14,112 INFO L87 Difference]: Start difference. First operand 250 states and 407 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-08 15:28:16,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:18,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:20,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:23,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:24,497 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-08 15:28:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:24,497 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-08 15:28:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:24,498 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-08 15:28:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:28:24,501 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-08 15:28:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-08 15:28:24,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-08 15:28:24,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:24,885 INFO L225 Difference]: With dead ends: 491 [2022-04-08 15:28:24,885 INFO L226 Difference]: Without dead ends: 267 [2022-04-08 15:28:24,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:24,886 INFO L913 BasicCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:24,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 362 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-04-08 15:28:24,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-08 15:28:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-08 15:28:24,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:24,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,899 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,899 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:24,905 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-08 15:28:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-08 15:28:24,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:24,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:24,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:28:24,907 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-08 15:28:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:24,913 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-08 15:28:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-08 15:28:24,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:24,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:24,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:24,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-08 15:28:24,920 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 62 [2022-04-08 15:28:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:24,920 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-08 15:28:24,921 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-08 15:28:24,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-08 15:28:25,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-08 15:28:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 15:28:25,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:25,276 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-08 15:28:25,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:28:25,276 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1864201878, now seen corresponding path program 1 times [2022-04-08 15:28:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:25,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662468566] [2022-04-08 15:28:25,303 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:25,303 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1864201878, now seen corresponding path program 2 times [2022-04-08 15:28:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:25,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039643142] [2022-04-08 15:28:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:25,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9961#true} is VALID [2022-04-08 15:28:25,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-08 15:28:25,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-08 15:28:25,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {9961#true} call ULTIMATE.init(); {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:25,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9961#true} is VALID [2022-04-08 15:28:25,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-08 15:28:25,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-08 15:28:25,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {9961#true} call #t~ret161 := main(); {9961#true} is VALID [2022-04-08 15:28:25,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {9961#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9961#true} is VALID [2022-04-08 15:28:25,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {9961#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9961#true} is VALID [2022-04-08 15:28:25,450 INFO L272 TraceCheckUtils]: 7: Hoare triple {9961#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9961#true} is VALID [2022-04-08 15:28:25,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {9961#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:28:25,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-08 15:28:25,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {9962#false} is VALID [2022-04-08 15:28:25,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {9962#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {9962#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {9962#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9962#false} is VALID [2022-04-08 15:28:25,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {9962#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {9962#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {9962#false} is VALID [2022-04-08 15:28:25,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {9962#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9962#false} is VALID [2022-04-08 15:28:25,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {9962#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {9962#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {9962#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {9962#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#false} ~skip~0 := 0; {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {9962#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {9962#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {9962#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {9962#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {9962#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {9962#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {9962#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {9962#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {9962#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {9962#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {9962#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {9962#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {9962#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {9962#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {9962#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {9962#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {9962#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {9962#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {9962#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {9962#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {9962#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {9962#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {9962#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {9962#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {9962#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 54: Hoare triple {9962#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 55: Hoare triple {9962#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {9962#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {9962#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {9962#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-08 15:28:25,467 INFO L290 TraceCheckUtils]: 59: Hoare triple {9962#false} assume 8641 == #t~mem76;havoc #t~mem76; {9962#false} is VALID [2022-04-08 15:28:25,467 INFO L290 TraceCheckUtils]: 60: Hoare triple {9962#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9962#false} is VALID [2022-04-08 15:28:25,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {9962#false} assume 4 == ~blastFlag~0; {9962#false} is VALID [2022-04-08 15:28:25,467 INFO L290 TraceCheckUtils]: 62: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-08 15:28:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:28:25,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:25,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039643142] [2022-04-08 15:28:25,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039643142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:25,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:25,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:25,470 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:25,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662468566] [2022-04-08 15:28:25,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662468566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:25,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:25,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:25,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200187582] [2022-04-08 15:28:25,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:25,471 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-08 15:28:25,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:25,472 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-08 15:28:25,519 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-08 15:28:25,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:25,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:25,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:25,521 INFO L87 Difference]: Start difference. First operand 250 states and 406 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-08 15:28:27,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:29,002 INFO L93 Difference]: Finished difference Result 563 states and 907 transitions. [2022-04-08 15:28:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:29,002 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-08 15:28:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:29,003 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-08 15:28:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-08 15:28:29,007 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-08 15:28:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-08 15:28:29,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-08 15:28:29,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:29,514 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:28:29,514 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:28:29,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:29,516 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 151 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:29,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 15:28:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:28:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:28:29,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:29,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:29,528 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:29,528 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:29,537 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-08 15:28:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-08 15:28:29,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:29,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:29,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:28:29,540 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:28:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:29,548 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-08 15:28:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-08 15:28:29,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:29,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:29,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:29,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-08 15:28:29,574 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 63 [2022-04-08 15:28:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:29,574 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-08 15:28:29,574 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-08 15:28:29,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-08 15:28:29,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-08 15:28:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 15:28:29,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:29,934 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-08 15:28:29,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:28:29,934 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1383254614, now seen corresponding path program 1 times [2022-04-08 15:28:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:29,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471851613] [2022-04-08 15:28:29,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:28:29,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1383254614, now seen corresponding path program 2 times [2022-04-08 15:28:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295605286] [2022-04-08 15:28:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:30,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:30,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12277#true} is VALID [2022-04-08 15:28:30,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-08 15:28:30,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-08 15:28:30,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {12277#true} call ULTIMATE.init(); {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:30,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12277#true} is VALID [2022-04-08 15:28:30,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-08 15:28:30,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-08 15:28:30,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {12277#true} call #t~ret161 := main(); {12277#true} is VALID [2022-04-08 15:28:30,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {12277#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12277#true} is VALID [2022-04-08 15:28:30,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {12277#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12277#true} is VALID [2022-04-08 15:28:30,118 INFO L272 TraceCheckUtils]: 7: Hoare triple {12277#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12277#true} is VALID [2022-04-08 15:28:30,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {12277#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-08 15:28:30,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12283#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-08 15:28:30,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {12283#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12278#false} is VALID [2022-04-08 15:28:30,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {12278#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {12278#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {12278#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {12278#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {12278#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {12278#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {12278#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {12278#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {12278#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12278#false} is VALID [2022-04-08 15:28:30,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {12278#false} ~skip~0 := 0; {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {12278#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {12278#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {12278#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {12278#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {12278#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 34: Hoare triple {12278#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {12278#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,132 INFO L290 TraceCheckUtils]: 36: Hoare triple {12278#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {12278#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,133 INFO L290 TraceCheckUtils]: 38: Hoare triple {12278#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {12278#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {12278#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {12278#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {12278#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {12278#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,140 INFO L290 TraceCheckUtils]: 44: Hoare triple {12278#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {12278#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,141 INFO L290 TraceCheckUtils]: 46: Hoare triple {12278#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {12278#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {12278#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {12278#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,141 INFO L290 TraceCheckUtils]: 50: Hoare triple {12278#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {12278#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,142 INFO L290 TraceCheckUtils]: 52: Hoare triple {12278#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {12278#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {12278#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {12278#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 56: Hoare triple {12278#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {12278#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {12278#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 59: Hoare triple {12278#false} assume 8641 == #t~mem76;havoc #t~mem76; {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {12278#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {12278#false} assume 4 == ~blastFlag~0; {12278#false} is VALID [2022-04-08 15:28:30,145 INFO L290 TraceCheckUtils]: 62: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-08 15:28:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:28:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:30,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295605286] [2022-04-08 15:28:30,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295605286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:30,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:30,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:30,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:30,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471851613] [2022-04-08 15:28:30,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471851613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:30,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:30,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220692168] [2022-04-08 15:28:30,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:30,148 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-08 15:28:30,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:30,149 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-08 15:28:30,196 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-08 15:28:30,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:30,197 INFO L87 Difference]: Start difference. First operand 250 states and 402 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-08 15:28:31,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:35,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:37,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:39,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:41,148 INFO L93 Difference]: Finished difference Result 563 states and 900 transitions. [2022-04-08 15:28:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:41,148 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-08 15:28:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:41,148 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-08 15:28:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-08 15:28:41,154 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-08 15:28:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-08 15:28:41,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-08 15:28:41,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:41,639 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:28:41,639 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:28:41,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:41,641 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:41,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-04-08 15:28:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:28:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:28:41,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:41,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:41,653 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:41,654 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:41,662 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-08 15:28:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-08 15:28:41,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:41,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:41,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:28:41,666 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:28:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:41,673 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-08 15:28:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-08 15:28:41,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:41,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:41,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:41,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-08 15:28:41,682 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 63 [2022-04-08 15:28:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:41,682 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-08 15:28:41,682 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-08 15:28:41,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-08 15:28:41,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-08 15:28:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 15:28:41,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:41,997 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:41,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:28:41,997 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash -243345409, now seen corresponding path program 1 times [2022-04-08 15:28:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:41,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [174960520] [2022-04-08 15:28:42,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:42,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -243345409, now seen corresponding path program 2 times [2022-04-08 15:28:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:42,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622433892] [2022-04-08 15:28:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:42,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:42,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14593#true} is VALID [2022-04-08 15:28:42,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-08 15:28:42,167 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-08 15:28:42,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {14593#true} call ULTIMATE.init(); {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:42,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14593#true} is VALID [2022-04-08 15:28:42,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-08 15:28:42,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-08 15:28:42,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {14593#true} call #t~ret161 := main(); {14593#true} is VALID [2022-04-08 15:28:42,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {14593#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14593#true} is VALID [2022-04-08 15:28:42,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {14593#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14593#true} is VALID [2022-04-08 15:28:42,169 INFO L272 TraceCheckUtils]: 7: Hoare triple {14593#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14593#true} is VALID [2022-04-08 15:28:42,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {14593#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:42,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14599#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-08 15:28:42,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {14599#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {14594#false} is VALID [2022-04-08 15:28:42,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {14594#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14594#false} is VALID [2022-04-08 15:28:42,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {14594#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {14594#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {14594#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14594#false} is VALID [2022-04-08 15:28:42,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {14594#false} ~skip~0 := 0; {14594#false} is VALID [2022-04-08 15:28:42,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {14594#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {14594#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {14594#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {14594#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {14594#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {14594#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {14594#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {14594#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {14594#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {14594#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {14594#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {14594#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {14594#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {14594#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 43: Hoare triple {14594#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {14594#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {14594#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {14594#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 47: Hoare triple {14594#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {14594#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {14594#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {14594#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,183 INFO L290 TraceCheckUtils]: 51: Hoare triple {14594#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {14594#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {14594#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {14594#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {14594#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {14594#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 57: Hoare triple {14594#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {14594#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-08 15:28:42,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {14594#false} assume 8641 == #t~mem76;havoc #t~mem76; {14594#false} is VALID [2022-04-08 15:28:42,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {14594#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14594#false} is VALID [2022-04-08 15:28:42,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {14594#false} assume 4 == ~blastFlag~0; {14594#false} is VALID [2022-04-08 15:28:42,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-08 15:28:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:28:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:42,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622433892] [2022-04-08 15:28:42,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622433892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:42,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:42,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:42,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:42,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [174960520] [2022-04-08 15:28:42,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [174960520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:42,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:42,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926844086] [2022-04-08 15:28:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:42,188 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-08 15:28:42,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:42,189 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-08 15:28:42,238 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-08 15:28:42,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:42,239 INFO L87 Difference]: Start difference. First operand 250 states and 398 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-08 15:28:45,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:47,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:51,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:28:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:52,491 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-08 15:28:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:28:52,491 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-08 15:28:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:28:52,492 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-08 15:28:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 15:28:52,495 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-08 15:28:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-08 15:28:52,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-08 15:28:52,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:52,796 INFO L225 Difference]: With dead ends: 488 [2022-04-08 15:28:52,796 INFO L226 Difference]: Without dead ends: 264 [2022-04-08 15:28:52,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:28:52,797 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:28:52,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-04-08 15:28:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-08 15:28:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-08 15:28:52,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:28:52,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:52,809 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:52,810 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:52,814 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-08 15:28:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-08 15:28:52,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:52,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:52,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-08 15:28:52,816 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-08 15:28:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:28:52,821 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-08 15:28:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-08 15:28:52,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:28:52,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:28:52,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:28:52,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:28:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:28:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-08 15:28:52,829 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 63 [2022-04-08 15:28:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:28:52,829 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-08 15:28:52,829 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-08 15:28:52,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-08 15:28:53,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:28:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-08 15:28:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 15:28:53,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:28:53,139 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:28:53,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 15:28:53,139 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:28:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:28:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash -102618722, now seen corresponding path program 1 times [2022-04-08 15:28:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:53,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025657664] [2022-04-08 15:28:53,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:28:53,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:28:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash -102618722, now seen corresponding path program 2 times [2022-04-08 15:28:53,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:28:53,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069197519] [2022-04-08 15:28:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:28:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:28:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:28:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:28:53,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16609#true} is VALID [2022-04-08 15:28:53,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-08 15:28:53,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-08 15:28:53,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {16609#true} call ULTIMATE.init(); {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:28:53,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16609#true} is VALID [2022-04-08 15:28:53,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-08 15:28:53,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-08 15:28:53,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {16609#true} call #t~ret161 := main(); {16609#true} is VALID [2022-04-08 15:28:53,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {16609#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16609#true} is VALID [2022-04-08 15:28:53,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {16609#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16609#true} is VALID [2022-04-08 15:28:53,319 INFO L272 TraceCheckUtils]: 7: Hoare triple {16609#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16609#true} is VALID [2022-04-08 15:28:53,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {16609#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:28:53,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16615#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-08 15:28:53,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {16615#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {16610#false} is VALID [2022-04-08 15:28:53,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {16610#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {16610#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {16610#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {16610#false} ~skip~0 := 0; {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {16610#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {16610#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {16610#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {16610#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {16610#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {16610#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,333 INFO L290 TraceCheckUtils]: 35: Hoare triple {16610#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {16610#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {16610#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {16610#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {16610#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {16610#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {16610#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {16610#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {16610#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {16610#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {16610#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {16610#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {16610#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {16610#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {16610#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {16610#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {16610#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 52: Hoare triple {16610#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {16610#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 54: Hoare triple {16610#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 55: Hoare triple {16610#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {16610#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {16610#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {16610#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-08 15:28:53,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {16610#false} assume 8641 == #t~mem76;havoc #t~mem76; {16610#false} is VALID [2022-04-08 15:28:53,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {16610#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16610#false} is VALID [2022-04-08 15:28:53,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {16610#false} assume 4 == ~blastFlag~0; {16610#false} is VALID [2022-04-08 15:28:53,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-08 15:28:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:28:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:28:53,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069197519] [2022-04-08 15:28:53,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069197519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:53,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:53,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:53,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:28:53,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025657664] [2022-04-08 15:28:53,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025657664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:28:53,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:28:53,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:28:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884778867] [2022-04-08 15:28:53,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:28:53,343 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-08 15:28:53,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:28:53,343 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-08 15:28:53,390 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-08 15:28:53,390 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:28:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:28:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:28:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:28:53,391 INFO L87 Difference]: Start difference. First operand 250 states and 397 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-08 15:28:58,527 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-08 15:29:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:02,200 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-08 15:29:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:02,201 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-08 15:29:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:02,202 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-08 15:29:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-08 15:29:02,207 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-08 15:29:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-08 15:29:02,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-08 15:29:02,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:02,546 INFO L225 Difference]: With dead ends: 487 [2022-04-08 15:29:02,546 INFO L226 Difference]: Without dead ends: 263 [2022-04-08 15:29:02,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:02,547 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:02,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-08 15:29:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-08 15:29:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-08 15:29:02,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:02,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:02,559 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:02,560 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:02,565 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-08 15:29:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-08 15:29:02,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:02,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:02,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-08 15:29:02,566 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-08 15:29:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:02,571 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-08 15:29:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-08 15:29:02,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:02,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:02,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:02,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-08 15:29:02,578 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 63 [2022-04-08 15:29:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:02,578 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-08 15:29:02,579 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-08 15:29:02,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-08 15:29:02,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-08 15:29:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-08 15:29:02,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:02,880 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:02,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 15:29:02,880 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:02,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash -16626991, now seen corresponding path program 1 times [2022-04-08 15:29:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:02,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904118935] [2022-04-08 15:29:02,900 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:29:02,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash -16626991, now seen corresponding path program 2 times [2022-04-08 15:29:02,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:02,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491203090] [2022-04-08 15:29:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:02,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:03,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:03,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18621#true} is VALID [2022-04-08 15:29:03,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-08 15:29:03,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-08 15:29:03,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {18621#true} call ULTIMATE.init(); {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:03,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18621#true} is VALID [2022-04-08 15:29:03,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-08 15:29:03,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-08 15:29:03,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {18621#true} call #t~ret161 := main(); {18621#true} is VALID [2022-04-08 15:29:03,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {18621#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18621#true} is VALID [2022-04-08 15:29:03,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {18621#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18621#true} is VALID [2022-04-08 15:29:03,022 INFO L272 TraceCheckUtils]: 7: Hoare triple {18621#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18621#true} is VALID [2022-04-08 15:29:03,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {18621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18622#false} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {18622#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {18622#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18622#false} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {18622#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {18622#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {18622#false} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {18622#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {18622#false} is VALID [2022-04-08 15:29:03,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {18622#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {18622#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {18622#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {18622#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {18622#false} ~skip~0 := 0; {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {18622#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {18622#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {18622#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {18622#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {18622#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {18622#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {18622#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {18622#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {18622#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {18622#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {18622#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {18622#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {18622#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {18622#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {18622#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {18622#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {18622#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {18622#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {18622#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {18622#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {18622#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {18622#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {18622#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {18622#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {18622#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {18622#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 56: Hoare triple {18622#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 57: Hoare triple {18622#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 58: Hoare triple {18622#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 59: Hoare triple {18622#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {18622#false} assume 8641 == #t~mem76;havoc #t~mem76; {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {18622#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {18622#false} assume 4 == ~blastFlag~0; {18622#false} is VALID [2022-04-08 15:29:03,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-08 15:29:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:29:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491203090] [2022-04-08 15:29:03,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491203090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:03,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:03,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:03,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904118935] [2022-04-08 15:29:03,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904118935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:03,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:03,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:03,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612281816] [2022-04-08 15:29:03,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:03,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:29:03,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:03,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:03,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:03,093 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:03,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:03,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:03,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:03,094 INFO L87 Difference]: Start difference. First operand 250 states and 396 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:06,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:09,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:12,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:14,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:15,813 INFO L93 Difference]: Finished difference Result 563 states and 891 transitions. [2022-04-08 15:29:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-08 15:29:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 15:29:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-08 15:29:15,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-08 15:29:16,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:16,227 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:29:16,227 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:29:16,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:16,228 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:16,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2022-04-08 15:29:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:29:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:29:16,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:16,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:16,241 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:16,241 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:16,248 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-08 15:29:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-08 15:29:16,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:16,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:16,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:29:16,249 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:29:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:16,256 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-08 15:29:16,256 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-08 15:29:16,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:16,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:16,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:16,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:16,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-08 15:29:16,263 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 64 [2022-04-08 15:29:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:16,263 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-08 15:29:16,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:16,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-08 15:29:16,563 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-08 15:29:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-08 15:29:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-08 15:29:16,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:16,564 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:16,564 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 15:29:16,564 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:16,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:16,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2085052975, now seen corresponding path program 1 times [2022-04-08 15:29:16,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:16,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147418206] [2022-04-08 15:29:16,592 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:29:16,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2085052975, now seen corresponding path program 2 times [2022-04-08 15:29:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:16,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643219835] [2022-04-08 15:29:16,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:16,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:16,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:16,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20937#true} is VALID [2022-04-08 15:29:16,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-08 15:29:16,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-08 15:29:16,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {20937#true} call ULTIMATE.init(); {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:16,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20937#true} is VALID [2022-04-08 15:29:16,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-08 15:29:16,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-08 15:29:16,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {20937#true} call #t~ret161 := main(); {20937#true} is VALID [2022-04-08 15:29:16,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {20937#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20937#true} is VALID [2022-04-08 15:29:16,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {20937#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {20937#true} is VALID [2022-04-08 15:29:16,723 INFO L272 TraceCheckUtils]: 7: Hoare triple {20937#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20937#true} is VALID [2022-04-08 15:29:16,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {20937#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:16,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {20938#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {20938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {20938#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {20938#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {20938#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {20938#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {20938#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {20938#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {20938#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {20938#false} ~skip~0 := 0; {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {20938#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {20938#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {20938#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {20938#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {20938#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {20938#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {20938#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {20938#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {20938#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {20938#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {20938#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {20938#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {20938#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {20938#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {20938#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {20938#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 47: Hoare triple {20938#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {20938#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 49: Hoare triple {20938#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 50: Hoare triple {20938#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {20938#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {20938#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {20938#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {20938#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {20938#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {20938#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {20938#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {20938#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {20938#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {20938#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {20938#false} assume 8641 == #t~mem76;havoc #t~mem76; {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {20938#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 63: Hoare triple {20938#false} assume 4 == ~blastFlag~0; {20938#false} is VALID [2022-04-08 15:29:16,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-08 15:29:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:29:16,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:16,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643219835] [2022-04-08 15:29:16,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643219835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:16,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:16,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:16,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:16,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147418206] [2022-04-08 15:29:16,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147418206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:16,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:16,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664026540] [2022-04-08 15:29:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 15:29:16,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:16,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:16,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:16,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:16,796 INFO L87 Difference]: Start difference. First operand 250 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-08 15:29:18,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:19,984 INFO L93 Difference]: Finished difference Result 563 states and 884 transitions. [2022-04-08 15:29:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-08 15:29:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 15:29:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-08 15:29:19,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-08 15:29:20,393 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-08 15:29:20,398 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:29:20,398 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:29:20,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:20,399 INFO L913 BasicCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:20,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:29:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:29:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-08 15:29:20,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:20,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:20,411 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:20,412 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:20,418 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-08 15:29:20,418 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-08 15:29:20,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:20,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:20,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:29:20,420 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:29:20,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:20,427 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-08 15:29:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-08 15:29:20,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:20,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:20,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:20,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-08 15:29:20,434 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 65 [2022-04-08 15:29:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:20,434 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-08 15:29:20,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:20,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-08 15:29:20,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:20,792 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-08 15:29:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:29:20,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:20,793 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:20,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 15:29:20,794 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash 891449068, now seen corresponding path program 1 times [2022-04-08 15:29:20,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:20,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277133135] [2022-04-08 15:29:20,819 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 15:29:20,819 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:20,819 INFO L85 PathProgramCache]: Analyzing trace with hash 891449068, now seen corresponding path program 2 times [2022-04-08 15:29:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220057390] [2022-04-08 15:29:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:20,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:20,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:20,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23253#true} is VALID [2022-04-08 15:29:20,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-08 15:29:20,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-08 15:29:20,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {23253#true} call ULTIMATE.init(); {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:20,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23253#true} is VALID [2022-04-08 15:29:20,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-08 15:29:20,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-08 15:29:20,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {23253#true} call #t~ret161 := main(); {23253#true} is VALID [2022-04-08 15:29:20,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {23253#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23253#true} is VALID [2022-04-08 15:29:20,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {23253#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23253#true} is VALID [2022-04-08 15:29:20,977 INFO L272 TraceCheckUtils]: 7: Hoare triple {23253#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23253#true} is VALID [2022-04-08 15:29:20,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {23253#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:29:20,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23259#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {23259#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {23254#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {23254#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {23254#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {23254#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {23254#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {23254#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {23254#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {23254#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {23254#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {23254#false} ~skip~0 := 0; {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 31: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 32: Hoare triple {23254#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {23254#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {23254#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {23254#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {23254#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {23254#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {23254#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {23254#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {23254#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:20,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {23254#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {23254#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {23254#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {23254#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {23254#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 46: Hoare triple {23254#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {23254#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {23254#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {23254#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 50: Hoare triple {23254#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {23254#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {23254#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {23254#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {23254#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 55: Hoare triple {23254#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 56: Hoare triple {23254#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 57: Hoare triple {23254#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 58: Hoare triple {23254#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 59: Hoare triple {23254#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 60: Hoare triple {23254#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 61: Hoare triple {23254#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#false} assume 8641 == #t~mem76;havoc #t~mem76; {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23254#false} is VALID [2022-04-08 15:29:21,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {23254#false} assume 4 == ~blastFlag~0; {23254#false} is VALID [2022-04-08 15:29:21,004 INFO L290 TraceCheckUtils]: 65: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-08 15:29:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:29:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:21,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220057390] [2022-04-08 15:29:21,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220057390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:21,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:21,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:21,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:21,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277133135] [2022-04-08 15:29:21,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277133135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:21,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:21,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:21,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928338108] [2022-04-08 15:29:21,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 15:29:21,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:21,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:21,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:21,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:21,068 INFO L87 Difference]: Start difference. First operand 250 states and 388 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:25,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:27,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:31,142 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-08 15:29:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:31,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 15:29:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-08 15:29:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-08 15:29:31,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-08 15:29:31,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:31,430 INFO L225 Difference]: With dead ends: 477 [2022-04-08 15:29:31,430 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 15:29:31,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:29:31,431 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:31,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-04-08 15:29:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 15:29:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-08 15:29:31,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:31,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,443 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,444 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:31,448 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-08 15:29:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-08 15:29:31,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:31,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:31,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 15:29:31,450 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-08 15:29:31,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:31,454 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-08 15:29:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-08 15:29:31,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:31,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:31,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:31,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-08 15:29:31,461 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 66 [2022-04-08 15:29:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:31,461 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-08 15:29:31,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:31,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-08 15:29:31,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-08 15:29:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 15:29:31,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:31,766 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:31,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 15:29:31,766 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:31,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1688521123, now seen corresponding path program 1 times [2022-04-08 15:29:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:31,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [308990183] [2022-04-08 15:29:31,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:31,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1688521123, now seen corresponding path program 2 times [2022-04-08 15:29:31,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:31,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309926211] [2022-04-08 15:29:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:31,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25225#true} is VALID [2022-04-08 15:29:31,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-08 15:29:31,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-08 15:29:31,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {25225#true} call ULTIMATE.init(); {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:31,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {25225#true} call #t~ret161 := main(); {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {25225#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {25225#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L272 TraceCheckUtils]: 7: Hoare triple {25225#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {25225#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {25225#true} is VALID [2022-04-08 15:29:31,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {25225#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {25225#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {25225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {25225#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#true} assume !false; {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {25225#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {25225#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {25225#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {25225#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {25225#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {25225#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {25225#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {25225#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {25225#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-08 15:29:31,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {25225#true} assume 8464 == #t~mem55;havoc #t~mem55; {25225#true} is VALID [2022-04-08 15:29:31,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {25225#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25225#true} is VALID [2022-04-08 15:29:31,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {25225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25225#true} is VALID [2022-04-08 15:29:31,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {25225#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} ~skip~0 := 0; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,921 INFO L290 TraceCheckUtils]: 31: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !false; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,928 INFO L290 TraceCheckUtils]: 48: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,929 INFO L290 TraceCheckUtils]: 52: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,931 INFO L290 TraceCheckUtils]: 55: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-08 15:29:31,933 INFO L290 TraceCheckUtils]: 61: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25231#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-08 15:29:31,933 INFO L290 TraceCheckUtils]: 62: Hoare triple {25231#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {25226#false} is VALID [2022-04-08 15:29:31,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {25226#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25226#false} is VALID [2022-04-08 15:29:31,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {25226#false} assume 4 == ~blastFlag~0; {25226#false} is VALID [2022-04-08 15:29:31,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {25226#false} assume !false; {25226#false} is VALID [2022-04-08 15:29:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:29:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:31,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309926211] [2022-04-08 15:29:31,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309926211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:31,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:31,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:31,935 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:31,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [308990183] [2022-04-08 15:29:31,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [308990183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:31,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:31,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472199568] [2022-04-08 15:29:31,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:31,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 15:29:31,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:31,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:32,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:32,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:32,005 INFO L87 Difference]: Start difference. First operand 250 states and 387 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:34,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:36,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:38,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:40,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:41,645 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2022-04-08 15:29:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-08 15:29:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 15:29:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-08 15:29:41,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-08 15:29:42,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:42,061 INFO L225 Difference]: With dead ends: 563 [2022-04-08 15:29:42,061 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 15:29:42,062 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-08 15:29:42,063 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 119 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 61 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:42,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 479 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-04-08 15:29:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 15:29:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-08 15:29:42,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:42,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,075 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,076 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:42,082 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-08 15:29:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-08 15:29:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:42,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:42,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:29:42,084 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-08 15:29:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:42,091 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-08 15:29:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-08 15:29:42,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:42,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:42,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:42,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-08 15:29:42,097 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 66 [2022-04-08 15:29:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:42,098 INFO L478 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-08 15:29:42,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-08 15:29:42,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-08 15:29:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 15:29:42,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:42,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:42,417 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 15:29:42,417 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 1 times [2022-04-08 15:29:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:42,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035972277] [2022-04-08 15:29:42,489 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:42,489 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 2 times [2022-04-08 15:29:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:42,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797283703] [2022-04-08 15:29:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:42,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:42,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:42,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27563#true} is VALID [2022-04-08 15:29:42,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-08 15:29:42,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-08 15:29:42,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {27563#true} call ULTIMATE.init(); {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:42,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27563#true} is VALID [2022-04-08 15:29:42,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-08 15:29:42,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {27563#true} call #t~ret161 := main(); {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {27563#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {27563#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L272 TraceCheckUtils]: 7: Hoare triple {27563#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {27563#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {27563#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {27563#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {27563#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {27563#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27563#true} is VALID [2022-04-08 15:29:42,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {27563#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27563#true} is VALID [2022-04-08 15:29:42,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {27563#true} assume !false; {27563#true} is VALID [2022-04-08 15:29:42,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {27563#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {27563#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {27563#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {27563#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,643 INFO L290 TraceCheckUtils]: 19: Hoare triple {27563#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {27563#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {27563#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {27563#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {27563#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-08 15:29:42,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {27563#true} assume 8464 == #t~mem55;havoc #t~mem55; {27563#true} is VALID [2022-04-08 15:29:42,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {27563#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27563#true} is VALID [2022-04-08 15:29:42,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {27563#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27563#true} is VALID [2022-04-08 15:29:42,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {27563#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:29:42,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27569#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-08 15:29:42,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {27569#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {27564#false} is VALID [2022-04-08 15:29:42,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {27564#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {27564#false} is VALID [2022-04-08 15:29:42,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {27564#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {27564#false} is VALID [2022-04-08 15:29:42,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {27564#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {27564#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {27564#false} is VALID [2022-04-08 15:29:42,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {27564#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {27564#false} is VALID [2022-04-08 15:29:42,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {27564#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {27564#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {27564#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {27564#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {27564#false} ~skip~0 := 0; {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {27564#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {27564#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {27564#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {27564#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 64: Hoare triple {27564#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {27564#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {27564#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {27564#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {27564#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {27564#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {27564#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {27564#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {27564#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {27564#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {27564#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {27564#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {27564#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {27564#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {27564#false} assume 8544 == #t~mem64;havoc #t~mem64; {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {27564#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 80: Hoare triple {27564#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {27564#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {27564#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {27564#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {27564#false} is VALID [2022-04-08 15:29:42,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {27564#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {27564#false} is VALID [2022-04-08 15:29:42,660 INFO L290 TraceCheckUtils]: 85: Hoare triple {27564#false} assume 8 == ~blastFlag~0; {27564#false} is VALID [2022-04-08 15:29:42,660 INFO L290 TraceCheckUtils]: 86: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-08 15:29:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:29:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:42,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797283703] [2022-04-08 15:29:42,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797283703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:42,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:42,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:42,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035972277] [2022-04-08 15:29:42,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035972277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:42,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:42,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830685391] [2022-04-08 15:29:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:42,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-08 15:29:42,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:42,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:42,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:42,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:42,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:42,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:42,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:42,739 INFO L87 Difference]: Start difference. First operand 261 states and 408 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:45,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:47,645 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:51,437 INFO L93 Difference]: Finished difference Result 614 states and 963 transitions. [2022-04-08 15:29:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:29:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-08 15:29:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:29:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:29:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:29:51,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 15:29:51,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:51,852 INFO L225 Difference]: With dead ends: 614 [2022-04-08 15:29:51,852 INFO L226 Difference]: Without dead ends: 379 [2022-04-08 15:29:51,853 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-08 15:29:51,853 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 132 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 59 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:29:51,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 358 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 481 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-08 15:29:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-08 15:29:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 287. [2022-04-08 15:29:51,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:29:51,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,880 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,880 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:51,888 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-08 15:29:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-08 15:29:51,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:51,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:51,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 15:29:51,890 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-08 15:29:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:29:51,898 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-08 15:29:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-08 15:29:51,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:29:51,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:29:51,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:29:51,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:29:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-08 15:29:51,906 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-08 15:29:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:29:51,907 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-08 15:29:51,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:51,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-08 15:29:52,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-08 15:29:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 15:29:52,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:29:52,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:29:52,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 15:29:52,275 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:29:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:29:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 1 times [2022-04-08 15:29:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:52,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006208752] [2022-04-08 15:29:52,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:29:52,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:29:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 2 times [2022-04-08 15:29:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:29:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308183654] [2022-04-08 15:29:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:29:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:29:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:52,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:29:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:29:52,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30135#true} is VALID [2022-04-08 15:29:52,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-08 15:29:52,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-08 15:29:52,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {30135#true} call ULTIMATE.init(); {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:29:52,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30135#true} is VALID [2022-04-08 15:29:52,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-08 15:29:52,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-08 15:29:52,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {30135#true} call #t~ret161 := main(); {30135#true} is VALID [2022-04-08 15:29:52,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {30135#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {30135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L272 TraceCheckUtils]: 7: Hoare triple {30135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {30135#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {30135#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {30135#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {30135#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {30135#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {30135#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {30135#true} assume !false; {30135#true} is VALID [2022-04-08 15:29:52,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {30135#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {30135#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {30135#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {30135#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {30135#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {30135#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {30135#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {30135#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {30135#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {30135#true} assume 8464 == #t~mem55;havoc #t~mem55; {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {30135#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30135#true} is VALID [2022-04-08 15:29:52,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {30135#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30135#true} is VALID [2022-04-08 15:29:52,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {30135#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,478 INFO L290 TraceCheckUtils]: 28: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,479 INFO L290 TraceCheckUtils]: 29: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} ~skip~0 := 0; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !false; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-08 15:29:52,487 INFO L290 TraceCheckUtils]: 48: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30141#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-08 15:29:52,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {30141#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {30136#false} is VALID [2022-04-08 15:29:52,487 INFO L290 TraceCheckUtils]: 50: Hoare triple {30136#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {30136#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {30136#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {30136#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {30136#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 55: Hoare triple {30136#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {30136#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {30136#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {30136#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {30136#false} ~skip~0 := 0; {30136#false} is VALID [2022-04-08 15:29:52,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {30136#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {30136#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {30136#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 64: Hoare triple {30136#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 65: Hoare triple {30136#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {30136#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {30136#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {30136#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {30136#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {30136#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 71: Hoare triple {30136#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 72: Hoare triple {30136#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 73: Hoare triple {30136#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 74: Hoare triple {30136#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 75: Hoare triple {30136#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 76: Hoare triple {30136#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 77: Hoare triple {30136#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {30136#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#false} assume 8544 == #t~mem64;havoc #t~mem64; {30136#false} is VALID [2022-04-08 15:29:52,490 INFO L290 TraceCheckUtils]: 80: Hoare triple {30136#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 81: Hoare triple {30136#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 82: Hoare triple {30136#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 83: Hoare triple {30136#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 84: Hoare triple {30136#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 85: Hoare triple {30136#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 86: Hoare triple {30136#false} assume 8 == ~blastFlag~0; {30136#false} is VALID [2022-04-08 15:29:52,491 INFO L290 TraceCheckUtils]: 87: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-08 15:29:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 15:29:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:29:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308183654] [2022-04-08 15:29:52,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308183654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:52,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:52,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:52,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:29:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006208752] [2022-04-08 15:29:52,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006208752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:29:52,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:29:52,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:29:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234995152] [2022-04-08 15:29:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:29:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:29:52,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:29:52,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:52,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:29:52,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:29:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:29:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:29:52,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:29:52,585 INFO L87 Difference]: Start difference. First operand 287 states and 448 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:29:55,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:57,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:29:59,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:01,175 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2022-04-08 15:30:01,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:30:01,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:30:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:30:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-08 15:30:01,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-08 15:30:01,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:01,590 INFO L225 Difference]: With dead ends: 626 [2022-04-08 15:30:01,591 INFO L226 Difference]: Without dead ends: 365 [2022-04-08 15:30:01,591 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-08 15:30:01,592 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 131 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 57 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:01,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 497 Invalid, 3 Unknown, 0 Unchecked, 6.8s Time] [2022-04-08 15:30:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-08 15:30:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2022-04-08 15:30:01,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:01,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,609 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,609 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:01,616 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-08 15:30:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-08 15:30:01,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:01,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:01,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-08 15:30:01,618 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-08 15:30:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:01,626 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-08 15:30:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-08 15:30:01,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:01,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:01,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:01,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-08 15:30:01,634 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-08 15:30:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:01,634 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-08 15:30:01,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:01,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-08 15:30:02,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-08 15:30:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-08 15:30:02,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:02,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:02,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 15:30:02,014 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:02,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 1 times [2022-04-08 15:30:02,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:02,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [327123991] [2022-04-08 15:30:02,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:02,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 2 times [2022-04-08 15:30:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:02,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10253905] [2022-04-08 15:30:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:02,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:02,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32703#true} is VALID [2022-04-08 15:30:02,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-08 15:30:02,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {32703#true} call ULTIMATE.init(); {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:02,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {32703#true} call #t~ret161 := main(); {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {32703#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {32703#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L272 TraceCheckUtils]: 7: Hoare triple {32703#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32703#true} is VALID [2022-04-08 15:30:02,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {32703#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {32703#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {32703#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {32703#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {32703#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {32703#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {32703#true} assume !false; {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {32703#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {32703#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {32703#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {32703#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {32703#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {32703#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {32703#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {32703#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {32703#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {32703#true} assume 8464 == #t~mem55;havoc #t~mem55; {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {32703#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32703#true} is VALID [2022-04-08 15:30:02,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {32703#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32703#true} is VALID [2022-04-08 15:30:02,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {32703#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:02,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32709#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-08 15:30:02,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {32709#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 49: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {32704#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {32704#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {32704#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {32704#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {32704#false} assume 8448 == #t~mem68;havoc #t~mem68; {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {32704#false} assume !(~num1~0 > 0); {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {32704#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {32704#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {32704#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 59: Hoare triple {32704#false} ~skip~0 := 0; {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 60: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {32704#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {32704#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {32704#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {32704#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {32704#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {32704#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {32704#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {32704#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 69: Hoare triple {32704#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 70: Hoare triple {32704#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 71: Hoare triple {32704#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 72: Hoare triple {32704#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,205 INFO L290 TraceCheckUtils]: 73: Hoare triple {32704#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 79: Hoare triple {32704#false} assume 8544 == #t~mem64;havoc #t~mem64; {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 80: Hoare triple {32704#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 81: Hoare triple {32704#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {32704#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {32704#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {32704#false} is VALID [2022-04-08 15:30:02,206 INFO L290 TraceCheckUtils]: 84: Hoare triple {32704#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {32704#false} is VALID [2022-04-08 15:30:02,207 INFO L290 TraceCheckUtils]: 85: Hoare triple {32704#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {32704#false} is VALID [2022-04-08 15:30:02,207 INFO L290 TraceCheckUtils]: 86: Hoare triple {32704#false} assume 8 == ~blastFlag~0; {32704#false} is VALID [2022-04-08 15:30:02,207 INFO L290 TraceCheckUtils]: 87: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-08 15:30:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 15:30:02,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:02,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10253905] [2022-04-08 15:30:02,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10253905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:02,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:02,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:02,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:02,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [327123991] [2022-04-08 15:30:02,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [327123991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:02,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:02,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:02,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932044085] [2022-04-08 15:30:02,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:30:02,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:02,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:02,283 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-08 15:30:02,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:30:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:02,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:30:02,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:30:02,284 INFO L87 Difference]: Start difference. First operand 287 states and 445 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:05,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:07,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:11,085 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-08 15:30:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:30:11,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-08 15:30:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:30:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-08 15:30:11,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-08 15:30:11,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:11,407 INFO L225 Difference]: With dead ends: 590 [2022-04-08 15:30:11,408 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 15:30:11,408 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-08 15:30:11,409 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:11,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 15:30:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 15:30:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-08 15:30:11,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:11,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,427 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,428 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:11,434 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-08 15:30:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-08 15:30:11,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:11,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:11,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:30:11,436 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:30:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:11,442 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-08 15:30:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-08 15:30:11,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:11,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:11,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:11,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-08 15:30:11,451 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-08 15:30:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:11,451 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-08 15:30:11,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:11,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-08 15:30:11,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-08 15:30:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 15:30:11,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:11,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:11,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 15:30:11,845 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:11,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 1 times [2022-04-08 15:30:11,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:11,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [669645449] [2022-04-08 15:30:11,899 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:11,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 2 times [2022-04-08 15:30:11,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:11,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616246087] [2022-04-08 15:30:11,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:11,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:12,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:12,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35171#true} is VALID [2022-04-08 15:30:12,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-08 15:30:12,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-08 15:30:12,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {35171#true} call ULTIMATE.init(); {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:12,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35171#true} is VALID [2022-04-08 15:30:12,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-08 15:30:12,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-08 15:30:12,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {35171#true} call #t~ret161 := main(); {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {35171#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {35171#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L272 TraceCheckUtils]: 7: Hoare triple {35171#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {35171#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {35171#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {35171#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {35171#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {35171#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {35171#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35171#true} is VALID [2022-04-08 15:30:12,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {35171#true} assume !false; {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {35171#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {35171#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {35171#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {35171#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {35171#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {35171#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {35171#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {35171#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {35171#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-08 15:30:12,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {35171#true} assume 8464 == #t~mem55;havoc #t~mem55; {35171#true} is VALID [2022-04-08 15:30:12,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {35171#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35171#true} is VALID [2022-04-08 15:30:12,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {35171#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35171#true} is VALID [2022-04-08 15:30:12,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {35171#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:12,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35177#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {35177#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {35172#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {35172#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 45: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 46: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 55: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 56: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {35172#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {35172#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {35172#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {35172#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {35172#false} assume 8448 == #t~mem68;havoc #t~mem68; {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {35172#false} assume !(~num1~0 > 0); {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 69: Hoare triple {35172#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 78: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 79: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 80: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 81: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 86: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 87: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 88: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 90: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 91: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 92: Hoare triple {35172#false} assume 8544 == #t~mem64;havoc #t~mem64; {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 93: Hoare triple {35172#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {35172#false} is VALID [2022-04-08 15:30:12,042 INFO L290 TraceCheckUtils]: 94: Hoare triple {35172#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L290 TraceCheckUtils]: 95: Hoare triple {35172#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L290 TraceCheckUtils]: 96: Hoare triple {35172#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L290 TraceCheckUtils]: 97: Hoare triple {35172#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L290 TraceCheckUtils]: 98: Hoare triple {35172#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L290 TraceCheckUtils]: 99: Hoare triple {35172#false} assume 8 == ~blastFlag~0; {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L290 TraceCheckUtils]: 100: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-08 15:30:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:30:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:12,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616246087] [2022-04-08 15:30:12,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616246087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:12,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:12,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:12,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:12,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [669645449] [2022-04-08 15:30:12,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [669645449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:12,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:12,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258806379] [2022-04-08 15:30:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:12,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-08 15:30:12,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:12,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:12,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:12,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:30:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:12,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:30:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:30:12,119 INFO L87 Difference]: Start difference. First operand 309 states and 479 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:14,110 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-08 15:30:17,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:23,149 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-08 15:30:23,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:30:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-08 15:30:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 15:30:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 15:30:23,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-08 15:30:23,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:23,472 INFO L225 Difference]: With dead ends: 612 [2022-04-08 15:30:23,472 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 15:30:23,473 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-08 15:30:23,473 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:23,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 15:30:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 15:30:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-08 15:30:23,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:23,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,490 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,490 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:23,497 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 15:30:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 15:30:23,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:23,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:23,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:30:23,498 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-08 15:30:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:23,505 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-08 15:30:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-08 15:30:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:23,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:23,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:23,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-08 15:30:23,514 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-08 15:30:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:23,514 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-08 15:30:23,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:23,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-08 15:30:23,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-08 15:30:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-08 15:30:23,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:23,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:23,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 15:30:23,906 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 1 times [2022-04-08 15:30:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:23,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498261117] [2022-04-08 15:30:23,975 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:23,975 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:23,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 2 times [2022-04-08 15:30:23,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:23,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220849580] [2022-04-08 15:30:23,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:23,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:24,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37683#true} is VALID [2022-04-08 15:30:24,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-08 15:30:24,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-08 15:30:24,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {37683#true} call ULTIMATE.init(); {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:24,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {37683#true} call #t~ret161 := main(); {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {37683#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {37683#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L272 TraceCheckUtils]: 7: Hoare triple {37683#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {37683#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {37683#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37683#true} is VALID [2022-04-08 15:30:24,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {37683#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {37683#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {37683#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {37683#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {37683#true} assume !false; {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {37683#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {37683#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {37683#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {37683#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {37683#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {37683#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {37683#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {37683#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {37683#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {37683#true} assume 8464 == #t~mem55;havoc #t~mem55; {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {37683#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37683#true} is VALID [2022-04-08 15:30:24,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {37683#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37683#true} is VALID [2022-04-08 15:30:24,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {37683#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-08 15:30:24,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37689#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 39: Hoare triple {37689#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 40: Hoare triple {37684#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {37684#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 44: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 45: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-08 15:30:24,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 47: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 48: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 51: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 52: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 53: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 54: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 55: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,148 INFO L290 TraceCheckUtils]: 56: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 57: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 59: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 60: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 61: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {37684#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {37684#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {37684#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {37684#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 68: Hoare triple {37684#false} assume 8448 == #t~mem68;havoc #t~mem68; {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {37684#false} assume !(~num1~0 > 0); {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {37684#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 75: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 76: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,150 INFO L290 TraceCheckUtils]: 77: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 79: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 80: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 81: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 82: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 83: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 84: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 85: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,151 INFO L290 TraceCheckUtils]: 86: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 87: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 88: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 89: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 90: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 91: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 92: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 93: Hoare triple {37684#false} assume 8544 == #t~mem64;havoc #t~mem64; {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 94: Hoare triple {37684#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 95: Hoare triple {37684#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 96: Hoare triple {37684#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37684#false} is VALID [2022-04-08 15:30:24,152 INFO L290 TraceCheckUtils]: 97: Hoare triple {37684#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {37684#false} is VALID [2022-04-08 15:30:24,153 INFO L290 TraceCheckUtils]: 98: Hoare triple {37684#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {37684#false} is VALID [2022-04-08 15:30:24,153 INFO L290 TraceCheckUtils]: 99: Hoare triple {37684#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {37684#false} is VALID [2022-04-08 15:30:24,153 INFO L290 TraceCheckUtils]: 100: Hoare triple {37684#false} assume 8 == ~blastFlag~0; {37684#false} is VALID [2022-04-08 15:30:24,153 INFO L290 TraceCheckUtils]: 101: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-08 15:30:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:30:24,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:24,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220849580] [2022-04-08 15:30:24,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220849580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:24,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:24,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:24,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498261117] [2022-04-08 15:30:24,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498261117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:24,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:24,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103878093] [2022-04-08 15:30:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:30:24,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:24,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:24,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:24,218 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:30:24,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:30:24,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:30:24,219 INFO L87 Difference]: Start difference. First operand 309 states and 478 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:26,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:27,536 INFO L93 Difference]: Finished difference Result 670 states and 1036 transitions. [2022-04-08 15:30:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:30:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:30:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 15:30:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-08 15:30:27,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-08 15:30:27,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:27,944 INFO L225 Difference]: With dead ends: 670 [2022-04-08 15:30:27,944 INFO L226 Difference]: Without dead ends: 387 [2022-04-08 15:30:27,945 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-08 15:30:27,945 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 140 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:27,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 394 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:30:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-08 15:30:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2022-04-08 15:30:27,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:27,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:27,965 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:27,966 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:27,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:27,974 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-08 15:30:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-08 15:30:27,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:27,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:27,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-08 15:30:27,976 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-08 15:30:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:27,992 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-08 15:30:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-08 15:30:27,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:27,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:27,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:27,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-08 15:30:28,000 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-08 15:30:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:28,000 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-08 15:30:28,000 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:28,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-08 15:30:28,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-08 15:30:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-08 15:30:28,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:28,480 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:28,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 15:30:28,481 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:28,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:28,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 1 times [2022-04-08 15:30:28,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:28,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935239038] [2022-04-08 15:30:28,545 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:28,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 2 times [2022-04-08 15:30:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:28,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828362476] [2022-04-08 15:30:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:28,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40427#true} is VALID [2022-04-08 15:30:28,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-08 15:30:28,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-08 15:30:28,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {40427#true} call ULTIMATE.init(); {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:28,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40427#true} is VALID [2022-04-08 15:30:28,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {40427#true} call #t~ret161 := main(); {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {40427#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {40427#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L272 TraceCheckUtils]: 7: Hoare triple {40427#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {40427#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {40427#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {40427#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {40427#true} is VALID [2022-04-08 15:30:28,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {40427#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {40427#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {40427#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {40427#true} assume !false; {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {40427#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {40427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {40427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {40427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {40427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {40427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {40427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {40427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {40427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-08 15:30:28,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {40427#true} assume 8464 == #t~mem55;havoc #t~mem55; {40427#true} is VALID [2022-04-08 15:30:28,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {40427#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40427#true} is VALID [2022-04-08 15:30:28,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {40427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40427#true} is VALID [2022-04-08 15:30:28,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {40427#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,667 INFO L290 TraceCheckUtils]: 36: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:30:28,669 INFO L290 TraceCheckUtils]: 39: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40433#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-08 15:30:28,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {40433#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {40428#false} is VALID [2022-04-08 15:30:28,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {40428#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,670 INFO L290 TraceCheckUtils]: 54: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 58: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 59: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 60: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 61: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {40428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {40428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {40428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {40428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {40428#false} assume 8448 == #t~mem68;havoc #t~mem68; {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 69: Hoare triple {40428#false} assume !(~num1~0 > 0); {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {40428#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 71: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 79: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 80: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 81: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 82: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 83: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 84: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 85: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 86: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,673 INFO L290 TraceCheckUtils]: 87: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 88: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 89: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 90: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 91: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 92: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 93: Hoare triple {40428#false} assume 8544 == #t~mem64;havoc #t~mem64; {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 94: Hoare triple {40428#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 95: Hoare triple {40428#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 96: Hoare triple {40428#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 97: Hoare triple {40428#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {40428#false} is VALID [2022-04-08 15:30:28,674 INFO L290 TraceCheckUtils]: 98: Hoare triple {40428#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40428#false} is VALID [2022-04-08 15:30:28,675 INFO L290 TraceCheckUtils]: 99: Hoare triple {40428#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {40428#false} is VALID [2022-04-08 15:30:28,675 INFO L290 TraceCheckUtils]: 100: Hoare triple {40428#false} assume 8 == ~blastFlag~0; {40428#false} is VALID [2022-04-08 15:30:28,675 INFO L290 TraceCheckUtils]: 101: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-08 15:30:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:30:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:28,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828362476] [2022-04-08 15:30:28,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828362476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:28,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:28,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:28,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:28,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935239038] [2022-04-08 15:30:28,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935239038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:28,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:28,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551308105] [2022-04-08 15:30:28,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:30:28,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:28,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:28,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:28,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:30:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:30:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:30:28,764 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:36,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:38,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:39,570 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-08 15:30:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:30:39,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-08 15:30:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:30:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:30:39,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-08 15:30:39,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:39,885 INFO L225 Difference]: With dead ends: 609 [2022-04-08 15:30:39,885 INFO L226 Difference]: Without dead ends: 326 [2022-04-08 15:30:39,886 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-08 15:30:39,886 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:39,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 15:30:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-08 15:30:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-08 15:30:39,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:39,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,905 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,905 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:39,911 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-08 15:30:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-08 15:30:39,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:39,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:39,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-08 15:30:39,913 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-08 15:30:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:39,919 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-08 15:30:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-08 15:30:39,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:39,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:39,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:39,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-08 15:30:39,927 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-08 15:30:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:39,927 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-08 15:30:39,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:39,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-08 15:30:40,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-08 15:30:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 15:30:40,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:40,315 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:40,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 15:30:40,315 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 1 times [2022-04-08 15:30:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:40,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033009418] [2022-04-08 15:30:40,378 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:40,378 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 2 times [2022-04-08 15:30:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880237235] [2022-04-08 15:30:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:40,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:40,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42927#true} is VALID [2022-04-08 15:30:40,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-08 15:30:40,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-08 15:30:40,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {42927#true} call ULTIMATE.init(); {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:40,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42927#true} is VALID [2022-04-08 15:30:40,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {42927#true} call #t~ret161 := main(); {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {42927#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {42927#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L272 TraceCheckUtils]: 7: Hoare triple {42927#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {42927#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {42927#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {42927#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {42927#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42927#true} is VALID [2022-04-08 15:30:40,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {42927#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 13: Hoare triple {42927#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {42927#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {42927#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {42927#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {42927#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {42927#true} assume 8464 == #t~mem55;havoc #t~mem55; {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {42927#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {42927#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {42927#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {42927#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {42927#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {42927#true} ~skip~0 := 0; {42927#true} is VALID [2022-04-08 15:30:40,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {42927#true} assume 8195 == #t~mem51;havoc #t~mem51; {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {42927#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {42927#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42927#true} is VALID [2022-04-08 15:30:40,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {42927#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {42927#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {42927#true} is VALID [2022-04-08 15:30:40,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {42927#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {42927#true} is VALID [2022-04-08 15:30:40,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {42927#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-08 15:30:40,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {42927#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,519 INFO L290 TraceCheckUtils]: 46: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,519 INFO L290 TraceCheckUtils]: 47: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,520 INFO L290 TraceCheckUtils]: 48: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,520 INFO L290 TraceCheckUtils]: 49: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,521 INFO L290 TraceCheckUtils]: 50: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,521 INFO L290 TraceCheckUtils]: 51: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-08 15:30:40,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42933#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 55: Hoare triple {42933#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 58: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 66: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 67: Hoare triple {42928#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {42928#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {42928#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {42928#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {42928#false} assume 8448 == #t~mem68;havoc #t~mem68; {42928#false} is VALID [2022-04-08 15:30:40,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {42928#false} assume !(~num1~0 > 0); {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 73: Hoare triple {42928#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {42928#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {42928#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {42928#false} ~skip~0 := 0; {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {42928#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {42928#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {42928#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {42928#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {42928#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 83: Hoare triple {42928#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {42928#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 93: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 94: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 95: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 96: Hoare triple {42928#false} assume 8544 == #t~mem64;havoc #t~mem64; {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 97: Hoare triple {42928#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 98: Hoare triple {42928#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 99: Hoare triple {42928#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 100: Hoare triple {42928#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {42928#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {42928#false} is VALID [2022-04-08 15:30:40,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {42928#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {42928#false} is VALID [2022-04-08 15:30:40,528 INFO L290 TraceCheckUtils]: 103: Hoare triple {42928#false} assume 8 == ~blastFlag~0; {42928#false} is VALID [2022-04-08 15:30:40,528 INFO L290 TraceCheckUtils]: 104: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-08 15:30:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 15:30:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:40,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880237235] [2022-04-08 15:30:40,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880237235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:40,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:40,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:40,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:40,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033009418] [2022-04-08 15:30:40,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033009418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:40,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:40,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685688471] [2022-04-08 15:30:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-08 15:30:40,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:40,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:40,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:40,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:30:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:30:40,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:30:40,608 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:46,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:48,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:30:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:49,538 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-08 15:30:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:30:49,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-08 15:30:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:30:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 15:30:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-08 15:30:49,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-08 15:30:49,830 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-08 15:30:49,835 INFO L225 Difference]: With dead ends: 620 [2022-04-08 15:30:49,835 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 15:30:49,836 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-08 15:30:49,836 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:30:49,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 390 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-04-08 15:30:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 15:30:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-08 15:30:49,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:30:49,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,856 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,857 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:49,863 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-08 15:30:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-08 15:30:49,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:49,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:49,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-08 15:30:49,865 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-08 15:30:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:30:49,871 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-08 15:30:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-08 15:30:49,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:30:49,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:30:49,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:30:49,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:30:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-08 15:30:49,879 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-08 15:30:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:30:49,880 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-08 15:30:49,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:49,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-08 15:30:50,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-08 15:30:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 15:30:50,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:30:50,367 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:30:50,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 15:30:50,367 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:30:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:30:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 1 times [2022-04-08 15:30:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:50,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966367236] [2022-04-08 15:30:50,438 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:30:50,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:30:50,438 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 2 times [2022-04-08 15:30:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:30:50,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982043707] [2022-04-08 15:30:50,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:30:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:30:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:50,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:30:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:30:50,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45503#true} is VALID [2022-04-08 15:30:50,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-08 15:30:50,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {45503#true} call ULTIMATE.init(); {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:30:50,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {45503#true} call #t~ret161 := main(); {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {45503#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {45503#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {45503#true} is VALID [2022-04-08 15:30:50,586 INFO L272 TraceCheckUtils]: 7: Hoare triple {45503#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {45503#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {45503#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {45503#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {45503#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {45503#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {45503#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {45503#true} assume !false; {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {45503#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {45503#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {45503#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {45503#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {45503#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {45503#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {45503#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {45503#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {45503#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {45503#true} assume 8464 == #t~mem55;havoc #t~mem55; {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {45503#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45503#true} is VALID [2022-04-08 15:30:50,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {45503#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45503#true} is VALID [2022-04-08 15:30:50,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {45503#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:30:50,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45509#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {45509#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {45504#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {45504#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 40: Hoare triple {45504#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {45504#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 42: Hoare triple {45504#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {45504#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {45504#false} assume 12292 != #t~mem85;havoc #t~mem85; {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {45504#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 46: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 49: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 60: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 61: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 62: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,596 INFO L290 TraceCheckUtils]: 63: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 68: Hoare triple {45504#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {45504#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {45504#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {45504#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {45504#false} assume 8448 == #t~mem68;havoc #t~mem68; {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {45504#false} assume !(~num1~0 > 0); {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {45504#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 76: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 81: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,598 INFO L290 TraceCheckUtils]: 82: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 88: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 89: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 90: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,599 INFO L290 TraceCheckUtils]: 91: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 92: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 93: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 94: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 95: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 96: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {45504#false} assume 8544 == #t~mem64;havoc #t~mem64; {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 98: Hoare triple {45504#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 99: Hoare triple {45504#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 100: Hoare triple {45504#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {45504#false} is VALID [2022-04-08 15:30:50,600 INFO L290 TraceCheckUtils]: 101: Hoare triple {45504#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {45504#false} is VALID [2022-04-08 15:30:50,601 INFO L290 TraceCheckUtils]: 102: Hoare triple {45504#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {45504#false} is VALID [2022-04-08 15:30:50,601 INFO L290 TraceCheckUtils]: 103: Hoare triple {45504#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {45504#false} is VALID [2022-04-08 15:30:50,601 INFO L290 TraceCheckUtils]: 104: Hoare triple {45504#false} assume 8 == ~blastFlag~0; {45504#false} is VALID [2022-04-08 15:30:50,601 INFO L290 TraceCheckUtils]: 105: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-08 15:30:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-08 15:30:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:30:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982043707] [2022-04-08 15:30:50,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982043707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:50,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:50,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:50,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:30:50,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966367236] [2022-04-08 15:30:50,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966367236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:30:50,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:30:50,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:30:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873363462] [2022-04-08 15:30:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:30:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-08 15:30:50,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:30:50,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:50,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:30:50,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:30:50,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:30:50,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:30:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:30:50,662 INFO L87 Difference]: Start difference. First operand 325 states and 494 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:30:56,870 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-08 15:30:58,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:00,058 INFO L93 Difference]: Finished difference Result 692 states and 1055 transitions. [2022-04-08 15:31:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:31:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-08 15:31:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:31:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 15:31:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-08 15:31:00,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-08 15:31:00,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:00,441 INFO L225 Difference]: With dead ends: 692 [2022-04-08 15:31:00,441 INFO L226 Difference]: Without dead ends: 393 [2022-04-08 15:31:00,442 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-08 15:31:00,442 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:31:00,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 408 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 15:31:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-08 15:31:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2022-04-08 15:31:00,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:31:00,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,460 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,461 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:00,469 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-08 15:31:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-08 15:31:00,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:00,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:00,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-08 15:31:00,471 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-08 15:31:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:00,479 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-08 15:31:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-08 15:31:00,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:00,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:00,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:31:00,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:31:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-08 15:31:00,488 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-08 15:31:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:31:00,488 INFO L478 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-08 15:31:00,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:00,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-08 15:31:00,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-08 15:31:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 15:31:00,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:31:00,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:31:00,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 15:31:00,988 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:31:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:31:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 1 times [2022-04-08 15:31:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:00,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [409876380] [2022-04-08 15:31:01,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:31:01,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:31:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 2 times [2022-04-08 15:31:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:31:01,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287927445] [2022-04-08 15:31:01,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:31:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:31:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:31:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:01,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48335#true} is VALID [2022-04-08 15:31:01,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-08 15:31:01,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {48335#true} call ULTIMATE.init(); {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:31:01,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {48335#true} call #t~ret161 := main(); {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {48335#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {48335#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48335#true} is VALID [2022-04-08 15:31:01,194 INFO L272 TraceCheckUtils]: 7: Hoare triple {48335#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {48335#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {48335#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {48335#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {48335#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {48335#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {48335#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {48335#true} assume 8464 == #t~mem55;havoc #t~mem55; {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {48335#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {48335#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {48335#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {48335#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {48335#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {48335#true} ~skip~0 := 0; {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {48335#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 42: Hoare triple {48335#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 43: Hoare triple {48335#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {48335#true} assume 8496 == #t~mem58;havoc #t~mem58; {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {48335#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {48335#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48335#true} is VALID [2022-04-08 15:31:01,198 INFO L290 TraceCheckUtils]: 47: Hoare triple {48335#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {48335#true} is VALID [2022-04-08 15:31:01,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {48335#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,203 INFO L290 TraceCheckUtils]: 57: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,204 INFO L290 TraceCheckUtils]: 59: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,204 INFO L290 TraceCheckUtils]: 60: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,207 INFO L290 TraceCheckUtils]: 67: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,208 INFO L290 TraceCheckUtils]: 68: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,208 INFO L290 TraceCheckUtils]: 70: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,210 INFO L290 TraceCheckUtils]: 73: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {48336#false} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {48336#false} assume !(~num1~0 > 0); {48336#false} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {48336#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48336#false} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {48336#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 80: Hoare triple {48336#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48336#false} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 81: Hoare triple {48336#false} ~skip~0 := 0; {48336#false} is VALID [2022-04-08 15:31:01,211 INFO L290 TraceCheckUtils]: 82: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 83: Hoare triple {48336#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 84: Hoare triple {48336#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 85: Hoare triple {48336#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {48336#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {48336#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 88: Hoare triple {48336#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {48336#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 90: Hoare triple {48336#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {48336#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 92: Hoare triple {48336#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,212 INFO L290 TraceCheckUtils]: 93: Hoare triple {48336#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 94: Hoare triple {48336#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 95: Hoare triple {48336#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 96: Hoare triple {48336#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 97: Hoare triple {48336#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 98: Hoare triple {48336#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 99: Hoare triple {48336#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 100: Hoare triple {48336#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 101: Hoare triple {48336#false} assume 8544 == #t~mem64;havoc #t~mem64; {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 102: Hoare triple {48336#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 103: Hoare triple {48336#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {48336#false} is VALID [2022-04-08 15:31:01,213 INFO L290 TraceCheckUtils]: 104: Hoare triple {48336#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {48336#false} is VALID [2022-04-08 15:31:01,214 INFO L290 TraceCheckUtils]: 105: Hoare triple {48336#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {48336#false} is VALID [2022-04-08 15:31:01,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {48336#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {48336#false} is VALID [2022-04-08 15:31:01,214 INFO L290 TraceCheckUtils]: 107: Hoare triple {48336#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {48336#false} is VALID [2022-04-08 15:31:01,214 INFO L290 TraceCheckUtils]: 108: Hoare triple {48336#false} assume 8 == ~blastFlag~0; {48336#false} is VALID [2022-04-08 15:31:01,214 INFO L290 TraceCheckUtils]: 109: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-08 15:31:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:31:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:31:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287927445] [2022-04-08 15:31:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287927445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:01,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:01,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:31:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [409876380] [2022-04-08 15:31:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [409876380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:01,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054315003] [2022-04-08 15:31:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:31:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-08 15:31:01,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:31:01,216 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-08 15:31:01,300 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-08 15:31:01,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:31:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:31:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:31:01,301 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:07,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:12,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:13,207 INFO L93 Difference]: Finished difference Result 768 states and 1165 transitions. [2022-04-08 15:31:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:31:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-08 15:31:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:31:13,208 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-08 15:31:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-08 15:31:13,210 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-08 15:31:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-08 15:31:13,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-08 15:31:13,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:13,599 INFO L225 Difference]: With dead ends: 768 [2022-04-08 15:31:13,599 INFO L226 Difference]: Without dead ends: 469 [2022-04-08 15:31:13,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:31:13,600 INFO L913 BasicCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-08 15:31:13,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-08 15:31:13,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-08 15:31:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 389. [2022-04-08 15:31:13,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:31:13,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:13,622 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:13,622 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:13,633 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-08 15:31:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-08 15:31:13,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:13,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:13,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-08 15:31:13,635 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-08 15:31:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:13,646 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-08 15:31:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-08 15:31:13,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:13,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:13,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:31:13,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:31:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-08 15:31:13,659 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-08 15:31:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:31:13,659 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-08 15:31:13,659 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-08 15:31:13,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-08 15:31:14,161 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-08 15:31:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-08 15:31:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 15:31:14,162 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:31:14,162 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-08 15:31:14,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 15:31:14,162 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:31:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:31:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -328927061, now seen corresponding path program 1 times [2022-04-08 15:31:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:14,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46419569] [2022-04-08 15:31:14,230 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:31:14,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:31:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -328927061, now seen corresponding path program 2 times [2022-04-08 15:31:14,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:31:14,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077578227] [2022-04-08 15:31:14,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:31:14,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:31:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:31:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:14,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51599#true} is VALID [2022-04-08 15:31:14,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-08 15:31:14,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-08 15:31:14,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {51599#true} call ULTIMATE.init(); {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:31:14,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51599#true} is VALID [2022-04-08 15:31:14,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-08 15:31:14,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {51599#true} call #t~ret161 := main(); {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {51599#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {51599#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L272 TraceCheckUtils]: 7: Hoare triple {51599#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {51599#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {51599#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {51599#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {51599#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {51599#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {51599#true} is VALID [2022-04-08 15:31:14,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {51599#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {51599#true} assume 8464 == #t~mem55;havoc #t~mem55; {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {51599#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {51599#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {51599#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {51599#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {51599#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {51599#true} ~skip~0 := 0; {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {51599#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {51599#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {51599#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {51599#true} assume 8496 == #t~mem58;havoc #t~mem58; {51599#true} is VALID [2022-04-08 15:31:14,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {51599#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51599#true} is VALID [2022-04-08 15:31:14,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {51599#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51599#true} is VALID [2022-04-08 15:31:14,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {51599#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {51599#true} is VALID [2022-04-08 15:31:14,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {51599#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,390 INFO L290 TraceCheckUtils]: 51: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} ~skip~0 := 0; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !false; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,392 INFO L290 TraceCheckUtils]: 56: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,394 INFO L290 TraceCheckUtils]: 62: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,395 INFO L290 TraceCheckUtils]: 63: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,395 INFO L290 TraceCheckUtils]: 64: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,397 INFO L290 TraceCheckUtils]: 67: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,397 INFO L290 TraceCheckUtils]: 68: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,397 INFO L290 TraceCheckUtils]: 69: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,398 INFO L290 TraceCheckUtils]: 70: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,398 INFO L290 TraceCheckUtils]: 71: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,399 INFO L290 TraceCheckUtils]: 72: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,399 INFO L290 TraceCheckUtils]: 73: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,401 INFO L290 TraceCheckUtils]: 77: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,401 INFO L290 TraceCheckUtils]: 78: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-08 15:31:14,402 INFO L290 TraceCheckUtils]: 80: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51605#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-08 15:31:14,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {51605#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 82: Hoare triple {51600#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {51600#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {51600#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {51600#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {51600#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {51600#false} ~skip~0 := 0; {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 88: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 89: Hoare triple {51600#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,403 INFO L290 TraceCheckUtils]: 90: Hoare triple {51600#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 91: Hoare triple {51600#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 92: Hoare triple {51600#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 93: Hoare triple {51600#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 94: Hoare triple {51600#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 95: Hoare triple {51600#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 96: Hoare triple {51600#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 97: Hoare triple {51600#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 98: Hoare triple {51600#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 99: Hoare triple {51600#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,404 INFO L290 TraceCheckUtils]: 100: Hoare triple {51600#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 101: Hoare triple {51600#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {51600#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 103: Hoare triple {51600#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 104: Hoare triple {51600#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 105: Hoare triple {51600#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {51600#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 107: Hoare triple {51600#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 108: Hoare triple {51600#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {51600#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {51600#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 111: Hoare triple {51600#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 112: Hoare triple {51600#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 113: Hoare triple {51600#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 114: Hoare triple {51600#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 115: Hoare triple {51600#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 116: Hoare triple {51600#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 117: Hoare triple {51600#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 118: Hoare triple {51600#false} assume 8640 == #t~mem75;havoc #t~mem75; {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {51600#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {51600#false} assume 4 == ~blastFlag~0; {51600#false} is VALID [2022-04-08 15:31:14,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-08 15:31:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:31:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:31:14,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077578227] [2022-04-08 15:31:14,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077578227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:14,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:14,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:14,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:31:14,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46419569] [2022-04-08 15:31:14,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46419569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:14,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:14,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:14,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762337627] [2022-04-08 15:31:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:31:14,410 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-08 15:31:14,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:31:14,410 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-08 15:31:14,506 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-08 15:31:14,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:31:14,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:14,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:31:14,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:31:14,507 INFO L87 Difference]: Start difference. First operand 389 states and 584 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:16,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:17,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:17,757 INFO L93 Difference]: Finished difference Result 860 states and 1297 transitions. [2022-04-08 15:31:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:31:17,757 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-08 15:31:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:31:17,758 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-08 15:31:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 15:31:17,760 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-08 15:31:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-08 15:31:17,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-08 15:31:18,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:18,147 INFO L225 Difference]: With dead ends: 860 [2022-04-08 15:31:18,147 INFO L226 Difference]: Without dead ends: 497 [2022-04-08 15:31:18,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:31:18,149 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 111 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:31:18,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 394 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 15:31:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-08 15:31:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 426. [2022-04-08 15:31:18,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:31:18,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:18,180 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:18,180 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:18,191 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-08 15:31:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-08 15:31:18,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:18,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:18,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:31:18,193 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:31:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:18,205 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-08 15:31:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-08 15:31:18,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:18,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:18,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:31:18,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:31:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-08 15:31:18,219 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 122 [2022-04-08 15:31:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:31:18,219 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-08 15:31:18,219 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-08 15:31:18,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-08 15:31:18,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-08 15:31:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 15:31:18,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:31:18,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:31:18,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 15:31:18,788 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:31:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:31:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 1 times [2022-04-08 15:31:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:18,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556227910] [2022-04-08 15:31:18,862 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:31:18,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:31:18,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 2 times [2022-04-08 15:31:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:31:18,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152241573] [2022-04-08 15:31:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:31:18,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:31:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:19,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:31:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:19,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {55177#true} is VALID [2022-04-08 15:31:19,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-08 15:31:19,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-08 15:31:19,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {55177#true} call ULTIMATE.init(); {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:31:19,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {55177#true} call #t~ret161 := main(); {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {55177#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {55177#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L272 TraceCheckUtils]: 7: Hoare triple {55177#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {55177#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {55177#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {55177#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {55177#true} is VALID [2022-04-08 15:31:19,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {55177#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {55177#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {55177#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {55177#true} assume 8464 == #t~mem55;havoc #t~mem55; {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {55177#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {55177#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {55177#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {55177#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {55177#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {55177#true} ~skip~0 := 0; {55177#true} is VALID [2022-04-08 15:31:19,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {55177#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {55177#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {55177#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {55177#true} assume 8496 == #t~mem58;havoc #t~mem58; {55177#true} is VALID [2022-04-08 15:31:19,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {55177#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {55177#true} is VALID [2022-04-08 15:31:19,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {55177#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55177#true} is VALID [2022-04-08 15:31:19,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {55177#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {55177#true} is VALID [2022-04-08 15:31:19,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {55177#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-08 15:31:19,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55183#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-08 15:31:19,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {55183#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {55178#false} is VALID [2022-04-08 15:31:19,036 INFO L290 TraceCheckUtils]: 61: Hoare triple {55178#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {55178#false} is VALID [2022-04-08 15:31:19,036 INFO L290 TraceCheckUtils]: 62: Hoare triple {55178#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,036 INFO L290 TraceCheckUtils]: 63: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,036 INFO L290 TraceCheckUtils]: 64: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 67: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 68: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 69: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 70: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 71: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 72: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 73: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,037 INFO L290 TraceCheckUtils]: 75: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 76: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 77: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 78: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 79: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 82: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 83: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 84: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {55178#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 86: Hoare triple {55178#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 87: Hoare triple {55178#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {55178#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {55178#false} assume 8448 == #t~mem68;havoc #t~mem68; {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 90: Hoare triple {55178#false} assume !(~num1~0 > 0); {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 91: Hoare triple {55178#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 94: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-08 15:31:19,039 INFO L290 TraceCheckUtils]: 95: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 97: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 98: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 99: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 100: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 101: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 102: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 103: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 104: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,040 INFO L290 TraceCheckUtils]: 105: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 107: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 108: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 109: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 110: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 111: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 112: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 113: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 114: Hoare triple {55178#false} assume 8544 == #t~mem64;havoc #t~mem64; {55178#false} is VALID [2022-04-08 15:31:19,041 INFO L290 TraceCheckUtils]: 115: Hoare triple {55178#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 116: Hoare triple {55178#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 117: Hoare triple {55178#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 118: Hoare triple {55178#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 119: Hoare triple {55178#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 120: Hoare triple {55178#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 121: Hoare triple {55178#false} assume 8 == ~blastFlag~0; {55178#false} is VALID [2022-04-08 15:31:19,042 INFO L290 TraceCheckUtils]: 122: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-08 15:31:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 15:31:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:31:19,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152241573] [2022-04-08 15:31:19,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152241573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:19,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:19,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:19,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:31:19,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556227910] [2022-04-08 15:31:19,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556227910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:19,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:19,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914445755] [2022-04-08 15:31:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:31:19,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:31:19,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:31:19,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:19,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:19,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:31:19,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:31:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:31:19,112 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:22,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:25,376 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-08 15:31:27,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:29,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:30,554 INFO L93 Difference]: Finished difference Result 892 states and 1345 transitions. [2022-04-08 15:31:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:31:30,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-08 15:31:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:31:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 15:31:30,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-08 15:31:30,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-08 15:31:30,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:30,947 INFO L225 Difference]: With dead ends: 892 [2022-04-08 15:31:30,947 INFO L226 Difference]: Without dead ends: 492 [2022-04-08 15:31:30,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:31:30,948 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 53 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:31:30,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 456 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-08 15:31:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-08 15:31:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-08 15:31:30,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:31:30,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:30,985 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:30,986 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:30,997 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-08 15:31:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-08 15:31:30,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:30,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:30,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-08 15:31:30,999 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-08 15:31:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:31,011 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-08 15:31:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-08 15:31:31,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:31,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:31,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:31:31,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:31:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2022-04-08 15:31:31,025 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 123 [2022-04-08 15:31:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:31:31,025 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2022-04-08 15:31:31,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:31,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 633 transitions. [2022-04-08 15:31:31,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2022-04-08 15:31:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 15:31:31,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:31:31,732 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-08 15:31:31,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 15:31:31,732 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:31:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:31:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 307351003, now seen corresponding path program 1 times [2022-04-08 15:31:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:31,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [688544794] [2022-04-08 15:31:31,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:31:31,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:31:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 307351003, now seen corresponding path program 2 times [2022-04-08 15:31:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:31:31,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698058183] [2022-04-08 15:31:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:31:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:31:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:31:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:31,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {58809#true} is VALID [2022-04-08 15:31:31,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-08 15:31:31,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-08 15:31:31,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {58809#true} call ULTIMATE.init(); {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:31:31,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {58809#true} call #t~ret161 := main(); {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {58809#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {58809#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L272 TraceCheckUtils]: 7: Hoare triple {58809#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {58809#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {58809#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {58809#true} is VALID [2022-04-08 15:31:31,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {58809#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {58809#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {58809#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {58809#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {58809#true} assume 8464 == #t~mem55;havoc #t~mem55; {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {58809#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {58809#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {58809#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {58809#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {58809#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {58809#true} ~skip~0 := 0; {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {58809#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {58809#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {58809#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {58809#true} assume 8496 == #t~mem58;havoc #t~mem58; {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {58809#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {58809#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58809#true} is VALID [2022-04-08 15:31:31,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {58809#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {58809#true} is VALID [2022-04-08 15:31:31,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {58809#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,951 INFO L290 TraceCheckUtils]: 52: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,957 INFO L290 TraceCheckUtils]: 66: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,961 INFO L290 TraceCheckUtils]: 75: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,962 INFO L290 TraceCheckUtils]: 77: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,962 INFO L290 TraceCheckUtils]: 78: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,962 INFO L290 TraceCheckUtils]: 79: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:31,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58815#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 82: Hoare triple {58815#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {58810#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 84: Hoare triple {58810#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 85: Hoare triple {58810#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 86: Hoare triple {58810#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 87: Hoare triple {58810#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 88: Hoare triple {58810#false} ~skip~0 := 0; {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 89: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 90: Hoare triple {58810#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,964 INFO L290 TraceCheckUtils]: 91: Hoare triple {58810#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 92: Hoare triple {58810#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 93: Hoare triple {58810#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 94: Hoare triple {58810#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 95: Hoare triple {58810#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 96: Hoare triple {58810#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 97: Hoare triple {58810#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 98: Hoare triple {58810#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 99: Hoare triple {58810#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,965 INFO L290 TraceCheckUtils]: 100: Hoare triple {58810#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 101: Hoare triple {58810#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 102: Hoare triple {58810#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 103: Hoare triple {58810#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 104: Hoare triple {58810#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 105: Hoare triple {58810#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 106: Hoare triple {58810#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 107: Hoare triple {58810#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 108: Hoare triple {58810#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 109: Hoare triple {58810#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,966 INFO L290 TraceCheckUtils]: 110: Hoare triple {58810#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 111: Hoare triple {58810#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 112: Hoare triple {58810#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 113: Hoare triple {58810#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 114: Hoare triple {58810#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 115: Hoare triple {58810#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 116: Hoare triple {58810#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 117: Hoare triple {58810#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 118: Hoare triple {58810#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-08 15:31:31,967 INFO L290 TraceCheckUtils]: 119: Hoare triple {58810#false} assume 8640 == #t~mem75;havoc #t~mem75; {58810#false} is VALID [2022-04-08 15:31:31,968 INFO L290 TraceCheckUtils]: 120: Hoare triple {58810#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {58810#false} is VALID [2022-04-08 15:31:31,968 INFO L290 TraceCheckUtils]: 121: Hoare triple {58810#false} assume 4 == ~blastFlag~0; {58810#false} is VALID [2022-04-08 15:31:31,968 INFO L290 TraceCheckUtils]: 122: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-08 15:31:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:31:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:31:31,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698058183] [2022-04-08 15:31:31,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698058183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:31,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:31,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:31,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:31:31,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [688544794] [2022-04-08 15:31:31,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [688544794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:31,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:31,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587209945] [2022-04-08 15:31:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:31:31,970 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-08 15:31:31,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:31:31,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:32,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:32,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:31:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:31:32,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:31:32,071 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:36,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:38,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:40,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:42,044 INFO L93 Difference]: Finished difference Result 897 states and 1337 transitions. [2022-04-08 15:31:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:31:42,045 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-08 15:31:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:31:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-08 15:31:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-08 15:31:42,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-08 15:31:42,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:42,395 INFO L225 Difference]: With dead ends: 897 [2022-04-08 15:31:42,395 INFO L226 Difference]: Without dead ends: 497 [2022-04-08 15:31:42,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-08 15:31:42,396 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 53 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:31:42,396 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 513 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 464 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2022-04-08 15:31:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-08 15:31:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 466. [2022-04-08 15:31:42,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:31:42,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,428 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,428 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:42,436 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-08 15:31:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-08 15:31:42,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:42,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:42,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:31:42,438 INFO L87 Difference]: Start difference. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-08 15:31:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:42,446 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-08 15:31:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-08 15:31:42,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:42,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:42,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:31:42,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:31:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 692 transitions. [2022-04-08 15:31:42,459 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 692 transitions. Word has length 123 [2022-04-08 15:31:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:31:42,460 INFO L478 AbstractCegarLoop]: Abstraction has 466 states and 692 transitions. [2022-04-08 15:31:42,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:42,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 466 states and 692 transitions. [2022-04-08 15:31:43,090 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-08 15:31:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 692 transitions. [2022-04-08 15:31:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 15:31:43,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:31:43,091 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-08 15:31:43,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 15:31:43,091 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:31:43,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:31:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2041455453, now seen corresponding path program 1 times [2022-04-08 15:31:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127797354] [2022-04-08 15:31:43,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:31:43,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:31:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2041455453, now seen corresponding path program 2 times [2022-04-08 15:31:43,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:31:43,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587180077] [2022-04-08 15:31:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:31:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:31:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:43,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:31:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:43,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {62541#true} is VALID [2022-04-08 15:31:43,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-08 15:31:43,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {62541#true} call ULTIMATE.init(); {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:31:43,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {62541#true} call #t~ret161 := main(); {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {62541#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {62541#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L272 TraceCheckUtils]: 7: Hoare triple {62541#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {62541#true} is VALID [2022-04-08 15:31:43,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {62541#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {62541#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {62541#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {62541#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {62541#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {62541#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {62541#true} assume 8464 == #t~mem55;havoc #t~mem55; {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {62541#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {62541#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62541#true} is VALID [2022-04-08 15:31:43,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {62541#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {62541#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {62541#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {62541#true} ~skip~0 := 0; {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {62541#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {62541#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {62541#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {62541#true} assume 8496 == #t~mem58;havoc #t~mem58; {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {62541#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {62541#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62541#true} is VALID [2022-04-08 15:31:43,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {62541#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {62541#true} is VALID [2022-04-08 15:31:43,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {62541#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} ~skip~0 := 0; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !false; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,301 INFO L290 TraceCheckUtils]: 60: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,302 INFO L290 TraceCheckUtils]: 64: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62547#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {62547#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 74: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 76: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 77: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 81: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 82: Hoare triple {62542#false} assume 8609 == #t~mem74;havoc #t~mem74; {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {62542#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {62542#false} is VALID [2022-04-08 15:31:43,305 INFO L290 TraceCheckUtils]: 84: Hoare triple {62542#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 85: Hoare triple {62542#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 86: Hoare triple {62542#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 87: Hoare triple {62542#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 88: Hoare triple {62542#false} ~skip~0 := 0; {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 89: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 90: Hoare triple {62542#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 91: Hoare triple {62542#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 92: Hoare triple {62542#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {62542#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {62542#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 95: Hoare triple {62542#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 96: Hoare triple {62542#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 97: Hoare triple {62542#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {62542#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {62542#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {62542#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {62542#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {62542#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {62542#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {62542#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 107: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 108: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 109: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 110: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 112: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 113: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,308 INFO L290 TraceCheckUtils]: 114: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 115: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 116: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 117: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 118: Hoare triple {62542#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 119: Hoare triple {62542#false} assume 8640 == #t~mem75;havoc #t~mem75; {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 120: Hoare triple {62542#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 121: Hoare triple {62542#false} assume 4 == ~blastFlag~0; {62542#false} is VALID [2022-04-08 15:31:43,309 INFO L290 TraceCheckUtils]: 122: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-08 15:31:43,310 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-08 15:31:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:31:43,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587180077] [2022-04-08 15:31:43,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587180077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:43,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:43,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:43,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:31:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127797354] [2022-04-08 15:31:43,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127797354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:43,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:43,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486148980] [2022-04-08 15:31:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:31:43,311 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-08 15:31:43,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:31:43,312 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-08 15:31:43,388 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-08 15:31:43,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:31:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:31:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:31:43,389 INFO L87 Difference]: Start difference. First operand 466 states and 692 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:46,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:48,929 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:54,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:31:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:55,495 INFO L93 Difference]: Finished difference Result 943 states and 1408 transitions. [2022-04-08 15:31:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:31:55,495 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-08 15:31:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:31:55,496 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-08 15:31:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:31:55,497 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-08 15:31:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-08 15:31:55,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-08 15:31:55,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:55,804 INFO L225 Difference]: With dead ends: 943 [2022-04-08 15:31:55,804 INFO L226 Difference]: Without dead ends: 503 [2022-04-08 15:31:55,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:31:55,805 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 28 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-08 15:31:55,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 589 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-08 15:31:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-04-08 15:31:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 490. [2022-04-08 15:31:55,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:31:55,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:55,841 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:55,841 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:55,850 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-08 15:31:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-08 15:31:55,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:55,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:55,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-08 15:31:55,851 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-08 15:31:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:31:55,859 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-08 15:31:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-08 15:31:55,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:31:55,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:31:55,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:31:55,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:31:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:31:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2022-04-08 15:31:55,870 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 123 [2022-04-08 15:31:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:31:55,870 INFO L478 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2022-04-08 15:31:55,870 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-08 15:31:55,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 727 transitions. [2022-04-08 15:31:56,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:31:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2022-04-08 15:31:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 15:31:56,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:31:56,526 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-08 15:31:56,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 15:31:56,527 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:31:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:31:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2114781281, now seen corresponding path program 1 times [2022-04-08 15:31:56,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:56,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2093591252] [2022-04-08 15:31:56,601 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:31:56,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:31:56,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2114781281, now seen corresponding path program 2 times [2022-04-08 15:31:56,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:31:56,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328422164] [2022-04-08 15:31:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:31:56,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:31:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:56,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:31:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:31:56,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66425#true} is VALID [2022-04-08 15:31:56,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-08 15:31:56,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-08 15:31:56,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {66425#true} call ULTIMATE.init(); {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:31:56,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66425#true} is VALID [2022-04-08 15:31:56,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-08 15:31:56,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-08 15:31:56,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {66425#true} call #t~ret161 := main(); {66425#true} is VALID [2022-04-08 15:31:56,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {66425#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {66425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L272 TraceCheckUtils]: 7: Hoare triple {66425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {66425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {66425#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {66425#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {66425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {66425#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {66425#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {66425#true} assume 8464 == #t~mem55;havoc #t~mem55; {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {66425#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66425#true} is VALID [2022-04-08 15:31:56,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {66425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {66425#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {66425#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {66425#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {66425#true} ~skip~0 := 0; {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {66425#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {66425#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {66425#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {66425#true} assume 8496 == #t~mem58;havoc #t~mem58; {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {66425#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66425#true} is VALID [2022-04-08 15:31:56,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {66425#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66425#true} is VALID [2022-04-08 15:31:56,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {66425#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {66425#true} is VALID [2022-04-08 15:31:56,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {66425#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,762 INFO L290 TraceCheckUtils]: 49: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,763 INFO L290 TraceCheckUtils]: 52: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,764 INFO L290 TraceCheckUtils]: 53: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,764 INFO L290 TraceCheckUtils]: 54: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,765 INFO L290 TraceCheckUtils]: 57: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,770 INFO L290 TraceCheckUtils]: 69: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,771 INFO L290 TraceCheckUtils]: 70: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,772 INFO L290 TraceCheckUtils]: 73: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,774 INFO L290 TraceCheckUtils]: 79: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 84: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {66431#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 85: Hoare triple {66431#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 86: Hoare triple {66426#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 87: Hoare triple {66426#false} assume 8672 == #t~mem79;havoc #t~mem79; {66426#false} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {66426#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {66426#false} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {66426#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {66426#false} is VALID [2022-04-08 15:31:56,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {66426#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 91: Hoare triple {66426#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 92: Hoare triple {66426#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 93: Hoare triple {66426#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 94: Hoare triple {66426#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 95: Hoare triple {66426#false} ~skip~0 := 0; {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 96: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {66426#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {66426#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 99: Hoare triple {66426#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {66426#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 101: Hoare triple {66426#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {66426#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {66426#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 104: Hoare triple {66426#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 105: Hoare triple {66426#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 106: Hoare triple {66426#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 107: Hoare triple {66426#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 108: Hoare triple {66426#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 109: Hoare triple {66426#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,779 INFO L290 TraceCheckUtils]: 110: Hoare triple {66426#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 111: Hoare triple {66426#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 112: Hoare triple {66426#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 113: Hoare triple {66426#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 114: Hoare triple {66426#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 115: Hoare triple {66426#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 116: Hoare triple {66426#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 117: Hoare triple {66426#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 118: Hoare triple {66426#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 119: Hoare triple {66426#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,780 INFO L290 TraceCheckUtils]: 120: Hoare triple {66426#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 121: Hoare triple {66426#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 122: Hoare triple {66426#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 123: Hoare triple {66426#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 124: Hoare triple {66426#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 125: Hoare triple {66426#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 126: Hoare triple {66426#false} assume 8640 == #t~mem75;havoc #t~mem75; {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 127: Hoare triple {66426#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 128: Hoare triple {66426#false} assume 4 == ~blastFlag~0; {66426#false} is VALID [2022-04-08 15:31:56,781 INFO L290 TraceCheckUtils]: 129: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-08 15:31:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 15:31:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:31:56,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328422164] [2022-04-08 15:31:56,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328422164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:56,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:56,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:56,783 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:31:56,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2093591252] [2022-04-08 15:31:56,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2093591252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:31:56,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:31:56,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:31:56,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329372241] [2022-04-08 15:31:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:31:56,783 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-08 15:31:56,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:31:56,784 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-08 15:31:56,875 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-08 15:31:56,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:31:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:31:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:31:56,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:31:56,876 INFO L87 Difference]: Start difference. First operand 490 states and 727 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-08 15:32:03,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:05,558 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-08 15:32:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:06,653 INFO L93 Difference]: Finished difference Result 979 states and 1456 transitions. [2022-04-08 15:32:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:32:06,653 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-08 15:32:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:32:06,653 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-08 15:32:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-04-08 15:32:06,656 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-08 15:32:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-04-08 15:32:06,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 502 transitions. [2022-04-08 15:32:06,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:07,007 INFO L225 Difference]: With dead ends: 979 [2022-04-08 15:32:07,007 INFO L226 Difference]: Without dead ends: 515 [2022-04-08 15:32:07,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:32:07,008 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 41 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:32:07,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 519 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-08 15:32:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-08 15:32:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-04-08 15:32:07,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:32:07,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:07,047 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:07,048 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:07,057 INFO L93 Difference]: Finished difference Result 515 states and 758 transitions. [2022-04-08 15:32:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 758 transitions. [2022-04-08 15:32:07,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:07,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:07,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 15:32:07,058 INFO L87 Difference]: Start difference. First operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 15:32:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:07,066 INFO L93 Difference]: Finished difference Result 515 states and 758 transitions. [2022-04-08 15:32:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 758 transitions. [2022-04-08 15:32:07,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:07,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:07,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:32:07,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:32:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 730 transitions. [2022-04-08 15:32:07,083 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 730 transitions. Word has length 130 [2022-04-08 15:32:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:32:07,083 INFO L478 AbstractCegarLoop]: Abstraction has 493 states and 730 transitions. [2022-04-08 15:32:07,084 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-08 15:32:07,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 493 states and 730 transitions. [2022-04-08 15:32:07,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 730 transitions. [2022-04-08 15:32:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:32:07,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:32:07,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:32:07,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 15:32:07,759 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:32:07,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:32:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 1 times [2022-04-08 15:32:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:07,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141941650] [2022-04-08 15:32:07,857 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:32:07,857 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:32:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 2 times [2022-04-08 15:32:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:32:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153734671] [2022-04-08 15:32:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:32:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:32:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:32:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:07,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {70418#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {70411#true} is VALID [2022-04-08 15:32:07,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {70411#true} assume true; {70411#true} is VALID [2022-04-08 15:32:07,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70411#true} {70411#true} #690#return; {70411#true} is VALID [2022-04-08 15:32:07,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {70411#true} call ULTIMATE.init(); {70418#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:32:07,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {70418#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {70411#true} is VALID [2022-04-08 15:32:07,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {70411#true} assume true; {70411#true} is VALID [2022-04-08 15:32:07,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70411#true} {70411#true} #690#return; {70411#true} is VALID [2022-04-08 15:32:07,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {70411#true} call #t~ret161 := main(); {70411#true} is VALID [2022-04-08 15:32:07,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {70411#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {70411#true} is VALID [2022-04-08 15:32:07,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {70411#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L272 TraceCheckUtils]: 7: Hoare triple {70411#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {70411#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {70411#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {70411#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {70411#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {70411#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {70411#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {70411#true} is VALID [2022-04-08 15:32:07,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {70411#true} assume !false; {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {70411#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {70411#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {70411#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {70411#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {70411#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {70411#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {70411#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {70411#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {70411#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {70411#true} assume 8464 == #t~mem55;havoc #t~mem55; {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {70411#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {70411#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {70411#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {70411#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {70411#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {70411#true} ~skip~0 := 0; {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {70411#true} assume !false; {70411#true} is VALID [2022-04-08 15:32:07,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {70411#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {70411#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 34: Hoare triple {70411#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {70411#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {70411#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {70411#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {70411#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {70411#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {70411#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {70411#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,998 INFO L290 TraceCheckUtils]: 42: Hoare triple {70411#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {70411#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:07,999 INFO L290 TraceCheckUtils]: 44: Hoare triple {70411#true} assume 8496 == #t~mem58;havoc #t~mem58; {70411#true} is VALID [2022-04-08 15:32:07,999 INFO L290 TraceCheckUtils]: 45: Hoare triple {70411#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70411#true} is VALID [2022-04-08 15:32:07,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {70411#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70411#true} is VALID [2022-04-08 15:32:07,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {70411#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {70411#true} is VALID [2022-04-08 15:32:08,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {70411#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,002 INFO L290 TraceCheckUtils]: 51: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,002 INFO L290 TraceCheckUtils]: 52: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,003 INFO L290 TraceCheckUtils]: 54: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,003 INFO L290 TraceCheckUtils]: 55: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,004 INFO L290 TraceCheckUtils]: 56: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,004 INFO L290 TraceCheckUtils]: 57: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,004 INFO L290 TraceCheckUtils]: 58: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,005 INFO L290 TraceCheckUtils]: 59: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,005 INFO L290 TraceCheckUtils]: 60: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,008 INFO L290 TraceCheckUtils]: 66: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:32:08,008 INFO L290 TraceCheckUtils]: 67: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70417#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-08 15:32:08,008 INFO L290 TraceCheckUtils]: 68: Hoare triple {70417#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {70412#false} is VALID [2022-04-08 15:32:08,008 INFO L290 TraceCheckUtils]: 69: Hoare triple {70412#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {70412#false} is VALID [2022-04-08 15:32:08,016 INFO L290 TraceCheckUtils]: 70: Hoare triple {70412#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {70412#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {70412#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {70412#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 74: Hoare triple {70412#false} ~skip~0 := 0; {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 75: Hoare triple {70412#false} assume !false; {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 76: Hoare triple {70412#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 77: Hoare triple {70412#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 78: Hoare triple {70412#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,017 INFO L290 TraceCheckUtils]: 79: Hoare triple {70412#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 80: Hoare triple {70412#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 81: Hoare triple {70412#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 82: Hoare triple {70412#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 83: Hoare triple {70412#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 84: Hoare triple {70412#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 85: Hoare triple {70412#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 86: Hoare triple {70412#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 87: Hoare triple {70412#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 88: Hoare triple {70412#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,018 INFO L290 TraceCheckUtils]: 89: Hoare triple {70412#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 90: Hoare triple {70412#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 91: Hoare triple {70412#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 92: Hoare triple {70412#false} assume 8528 == #t~mem62;havoc #t~mem62; {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 93: Hoare triple {70412#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 94: Hoare triple {70412#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 95: Hoare triple {70412#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {70412#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 97: Hoare triple {70412#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 98: Hoare triple {70412#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {70412#false} is VALID [2022-04-08 15:32:08,019 INFO L290 TraceCheckUtils]: 99: Hoare triple {70412#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 100: Hoare triple {70412#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 101: Hoare triple {70412#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 102: Hoare triple {70412#false} ~skip~0 := 0; {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 103: Hoare triple {70412#false} assume !false; {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 104: Hoare triple {70412#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 105: Hoare triple {70412#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 106: Hoare triple {70412#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 107: Hoare triple {70412#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 108: Hoare triple {70412#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 109: Hoare triple {70412#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,020 INFO L290 TraceCheckUtils]: 110: Hoare triple {70412#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 111: Hoare triple {70412#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 112: Hoare triple {70412#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 113: Hoare triple {70412#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 114: Hoare triple {70412#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 115: Hoare triple {70412#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 116: Hoare triple {70412#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 117: Hoare triple {70412#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 118: Hoare triple {70412#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,021 INFO L290 TraceCheckUtils]: 119: Hoare triple {70412#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 120: Hoare triple {70412#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 121: Hoare triple {70412#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 122: Hoare triple {70412#false} assume 8544 == #t~mem64;havoc #t~mem64; {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 123: Hoare triple {70412#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 124: Hoare triple {70412#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 125: Hoare triple {70412#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 126: Hoare triple {70412#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 127: Hoare triple {70412#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 128: Hoare triple {70412#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 129: Hoare triple {70412#false} assume 8 == ~blastFlag~0; {70412#false} is VALID [2022-04-08 15:32:08,022 INFO L290 TraceCheckUtils]: 130: Hoare triple {70412#false} assume !false; {70412#false} is VALID [2022-04-08 15:32:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-08 15:32:08,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:32:08,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153734671] [2022-04-08 15:32:08,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153734671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:08,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:08,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:32:08,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:32:08,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141941650] [2022-04-08 15:32:08,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141941650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:08,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:08,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:32:08,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358803557] [2022-04-08 15:32:08,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:32:08,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:08,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:32:08,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:08,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:08,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:32:08,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:32:08,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:32:08,113 INFO L87 Difference]: Start difference. First operand 493 states and 730 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:11,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:14,399 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-08 15:32:18,762 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-08 15:32:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:19,870 INFO L93 Difference]: Finished difference Result 982 states and 1458 transitions. [2022-04-08 15:32:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:32:19,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:32:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:19,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-08 15:32:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-08 15:32:19,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-08 15:32:20,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:20,202 INFO L225 Difference]: With dead ends: 982 [2022-04-08 15:32:20,202 INFO L226 Difference]: Without dead ends: 515 [2022-04-08 15:32:20,203 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 15:32:20,203 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 57 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 535 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.9s IncrementalHoareTripleChecker+Time [2022-04-08 15:32:20,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 535 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-08 15:32:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-08 15:32:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-04-08 15:32:20,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:32:20,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:20,243 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:20,243 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:20,256 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-08 15:32:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-08 15:32:20,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:20,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:20,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 15:32:20,258 INFO L87 Difference]: Start difference. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-08 15:32:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:20,271 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-08 15:32:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-08 15:32:20,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:20,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:20,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:32:20,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:32:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2022-04-08 15:32:20,296 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 131 [2022-04-08 15:32:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:32:20,296 INFO L478 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2022-04-08 15:32:20,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:20,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 493 states and 729 transitions. [2022-04-08 15:32:20,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2022-04-08 15:32:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:32:20,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:32:20,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:32:20,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 15:32:20,980 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:32:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:32:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 1 times [2022-04-08 15:32:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:20,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952690556] [2022-04-08 15:32:21,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:32:21,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:32:21,083 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 2 times [2022-04-08 15:32:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:32:21,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126209505] [2022-04-08 15:32:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:32:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:32:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:32:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:21,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {74409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74403#true} is VALID [2022-04-08 15:32:21,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {74403#true} assume true; {74403#true} is VALID [2022-04-08 15:32:21,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74403#true} {74403#true} #690#return; {74403#true} is VALID [2022-04-08 15:32:21,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {74403#true} call ULTIMATE.init(); {74409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:32:21,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {74409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74403#true} is VALID [2022-04-08 15:32:21,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {74403#true} assume true; {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74403#true} {74403#true} #690#return; {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {74403#true} call #t~ret161 := main(); {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {74403#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {74403#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L272 TraceCheckUtils]: 7: Hoare triple {74403#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {74403#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {74403#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {74403#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {74403#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74403#true} is VALID [2022-04-08 15:32:21,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {74403#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {74403#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {74403#true} assume !false; {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {74403#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {74403#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {74403#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {74403#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {74403#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {74403#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {74403#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {74403#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {74403#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {74403#true} assume 8464 == #t~mem55;havoc #t~mem55; {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {74403#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {74403#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {74403#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {74403#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {74403#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {74403#true} ~skip~0 := 0; {74403#true} is VALID [2022-04-08 15:32:21,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {74403#true} assume !false; {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {74403#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {74403#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {74403#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {74403#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {74403#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {74403#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {74403#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {74403#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {74403#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {74403#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {74403#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {74403#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-08 15:32:21,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {74403#true} assume 8496 == #t~mem58;havoc #t~mem58; {74403#true} is VALID [2022-04-08 15:32:21,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {74403#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74403#true} is VALID [2022-04-08 15:32:21,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {74403#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,235 INFO L290 TraceCheckUtils]: 68: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,235 INFO L290 TraceCheckUtils]: 69: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,236 INFO L290 TraceCheckUtils]: 72: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,236 INFO L290 TraceCheckUtils]: 73: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,240 INFO L290 TraceCheckUtils]: 84: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,240 INFO L290 TraceCheckUtils]: 85: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,241 INFO L290 TraceCheckUtils]: 87: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,241 INFO L290 TraceCheckUtils]: 88: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,242 INFO L290 TraceCheckUtils]: 90: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,242 INFO L290 TraceCheckUtils]: 91: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,242 INFO L290 TraceCheckUtils]: 92: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,242 INFO L290 TraceCheckUtils]: 93: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,243 INFO L290 TraceCheckUtils]: 94: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,243 INFO L290 TraceCheckUtils]: 95: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,243 INFO L290 TraceCheckUtils]: 96: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,244 INFO L290 TraceCheckUtils]: 97: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,244 INFO L290 TraceCheckUtils]: 98: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,244 INFO L290 TraceCheckUtils]: 99: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,245 INFO L290 TraceCheckUtils]: 100: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,245 INFO L290 TraceCheckUtils]: 101: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,245 INFO L290 TraceCheckUtils]: 102: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,245 INFO L290 TraceCheckUtils]: 103: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,246 INFO L290 TraceCheckUtils]: 104: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,246 INFO L290 TraceCheckUtils]: 105: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,246 INFO L290 TraceCheckUtils]: 106: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,247 INFO L290 TraceCheckUtils]: 107: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,247 INFO L290 TraceCheckUtils]: 108: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,247 INFO L290 TraceCheckUtils]: 109: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,248 INFO L290 TraceCheckUtils]: 110: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,248 INFO L290 TraceCheckUtils]: 111: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,248 INFO L290 TraceCheckUtils]: 112: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,248 INFO L290 TraceCheckUtils]: 113: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,249 INFO L290 TraceCheckUtils]: 114: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,249 INFO L290 TraceCheckUtils]: 115: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,249 INFO L290 TraceCheckUtils]: 116: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,250 INFO L290 TraceCheckUtils]: 117: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,250 INFO L290 TraceCheckUtils]: 118: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,250 INFO L290 TraceCheckUtils]: 119: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,251 INFO L290 TraceCheckUtils]: 120: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,251 INFO L290 TraceCheckUtils]: 121: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,251 INFO L290 TraceCheckUtils]: 122: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,251 INFO L290 TraceCheckUtils]: 123: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,252 INFO L290 TraceCheckUtils]: 124: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,252 INFO L290 TraceCheckUtils]: 125: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,252 INFO L290 TraceCheckUtils]: 126: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,253 INFO L290 TraceCheckUtils]: 127: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,253 INFO L290 TraceCheckUtils]: 128: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:32:21,253 INFO L290 TraceCheckUtils]: 129: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {74404#false} is VALID [2022-04-08 15:32:21,253 INFO L290 TraceCheckUtils]: 130: Hoare triple {74404#false} assume !false; {74404#false} is VALID [2022-04-08 15:32:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 15:32:21,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:32:21,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126209505] [2022-04-08 15:32:21,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126209505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:21,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:21,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:21,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:32:21,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952690556] [2022-04-08 15:32:21,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952690556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:21,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:21,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:21,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833050882] [2022-04-08 15:32:21,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:32:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:21,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:32:21,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:21,326 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-08 15:32:21,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:32:21,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:32:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:32:21,331 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:23,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:25,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:29,114 INFO L93 Difference]: Finished difference Result 1422 states and 2123 transitions. [2022-04-08 15:32:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:32:29,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:32:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-08 15:32:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-08 15:32:29,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-08 15:32:29,503 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-08 15:32:29,538 INFO L225 Difference]: With dead ends: 1422 [2022-04-08 15:32:29,539 INFO L226 Difference]: Without dead ends: 955 [2022-04-08 15:32:29,539 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-08 15:32:29,540 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-08 15:32:29,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 439 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-08 15:32:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-04-08 15:32:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-04-08 15:32:29,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:32:29,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,624 INFO L74 IsIncluded]: Start isIncluded. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,625 INFO L87 Difference]: Start difference. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:29,658 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-08 15:32:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-08 15:32:29,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:29,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:29,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-08 15:32:29,660 INFO L87 Difference]: Start difference. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-08 15:32:29,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:29,685 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-08 15:32:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-08 15:32:29,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:29,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:29,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:32:29,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:32:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1414 transitions. [2022-04-08 15:32:29,721 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1414 transitions. Word has length 131 [2022-04-08 15:32:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:32:29,722 INFO L478 AbstractCegarLoop]: Abstraction has 955 states and 1414 transitions. [2022-04-08 15:32:29,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:29,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 955 states and 1414 transitions. [2022-04-08 15:32:31,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1414 edges. 1414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:31,027 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-08 15:32:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:32:31,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:32:31,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:32:31,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 15:32:31,028 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:32:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:32:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 1 times [2022-04-08 15:32:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:31,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1936752377] [2022-04-08 15:32:31,118 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:32:31,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:32:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 2 times [2022-04-08 15:32:31,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:32:31,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842926765] [2022-04-08 15:32:31,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:32:31,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:32:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:32:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:31,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {81082#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81076#true} is VALID [2022-04-08 15:32:31,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {81076#true} assume true; {81076#true} is VALID [2022-04-08 15:32:31,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81076#true} {81076#true} #690#return; {81076#true} is VALID [2022-04-08 15:32:31,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {81076#true} call ULTIMATE.init(); {81082#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:32:31,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {81082#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81076#true} is VALID [2022-04-08 15:32:31,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {81076#true} assume true; {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81076#true} {81076#true} #690#return; {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {81076#true} call #t~ret161 := main(); {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {81076#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {81076#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L272 TraceCheckUtils]: 7: Hoare triple {81076#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {81076#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {81076#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {81076#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {81076#true} is VALID [2022-04-08 15:32:31,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {81076#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {81076#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {81076#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {81076#true} assume !false; {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {81076#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {81076#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {81076#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {81076#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {81076#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {81076#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {81076#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {81076#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {81076#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-08 15:32:31,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {81076#true} assume 8464 == #t~mem55;havoc #t~mem55; {81076#true} is VALID [2022-04-08 15:32:31,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {81076#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81076#true} is VALID [2022-04-08 15:32:31,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {81076#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !false; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,246 INFO L290 TraceCheckUtils]: 41: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,247 INFO L290 TraceCheckUtils]: 43: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {81077#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {81077#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {81077#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {81077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {81077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {81077#false} ~skip~0 := 0; {81077#false} is VALID [2022-04-08 15:32:31,248 INFO L290 TraceCheckUtils]: 53: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {81077#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {81077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {81077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {81077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {81077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {81077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {81077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {81077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {81077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {81077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {81077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {81077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {81077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {81077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {81077#false} assume 8512 == #t~mem60;havoc #t~mem60; {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {81077#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 70: Hoare triple {81077#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {81077#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {81077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 73: Hoare triple {81077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 74: Hoare triple {81077#false} ~skip~0 := 0; {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {81077#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 77: Hoare triple {81077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {81077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {81077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {81077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {81077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,251 INFO L290 TraceCheckUtils]: 82: Hoare triple {81077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {81077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {81077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 85: Hoare triple {81077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 86: Hoare triple {81077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 87: Hoare triple {81077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 88: Hoare triple {81077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 89: Hoare triple {81077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 90: Hoare triple {81077#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 91: Hoare triple {81077#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,252 INFO L290 TraceCheckUtils]: 92: Hoare triple {81077#false} assume 8528 == #t~mem62;havoc #t~mem62; {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 93: Hoare triple {81077#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 94: Hoare triple {81077#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 95: Hoare triple {81077#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 96: Hoare triple {81077#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 97: Hoare triple {81077#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 98: Hoare triple {81077#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 99: Hoare triple {81077#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 100: Hoare triple {81077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 101: Hoare triple {81077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 102: Hoare triple {81077#false} ~skip~0 := 0; {81077#false} is VALID [2022-04-08 15:32:31,253 INFO L290 TraceCheckUtils]: 103: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 104: Hoare triple {81077#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 105: Hoare triple {81077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {81077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {81077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 108: Hoare triple {81077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {81077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {81077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 111: Hoare triple {81077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 112: Hoare triple {81077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,254 INFO L290 TraceCheckUtils]: 113: Hoare triple {81077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 114: Hoare triple {81077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 115: Hoare triple {81077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 116: Hoare triple {81077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 117: Hoare triple {81077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 118: Hoare triple {81077#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 119: Hoare triple {81077#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 120: Hoare triple {81077#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 121: Hoare triple {81077#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 122: Hoare triple {81077#false} assume 8544 == #t~mem64;havoc #t~mem64; {81077#false} is VALID [2022-04-08 15:32:31,255 INFO L290 TraceCheckUtils]: 123: Hoare triple {81077#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 124: Hoare triple {81077#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 125: Hoare triple {81077#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 126: Hoare triple {81077#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 127: Hoare triple {81077#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 128: Hoare triple {81077#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 129: Hoare triple {81077#false} assume 8 == ~blastFlag~0; {81077#false} is VALID [2022-04-08 15:32:31,256 INFO L290 TraceCheckUtils]: 130: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-08 15:32:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-08 15:32:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:32:31,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842926765] [2022-04-08 15:32:31,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842926765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:31,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:31,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:31,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:32:31,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1936752377] [2022-04-08 15:32:31,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1936752377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:31,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:31,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:31,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772951779] [2022-04-08 15:32:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:32:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:31,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:32:31,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:31,323 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-08 15:32:31,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:32:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:32:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:32:31,324 INFO L87 Difference]: Start difference. First operand 955 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:33,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:34,186 INFO L93 Difference]: Finished difference Result 1911 states and 2835 transitions. [2022-04-08 15:32:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:32:34,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:32:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-08 15:32:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-08 15:32:34,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-08 15:32:34,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:34,519 INFO L225 Difference]: With dead ends: 1911 [2022-04-08 15:32:34,520 INFO L226 Difference]: Without dead ends: 982 [2022-04-08 15:32:34,521 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-08 15:32:34,522 INFO L913 BasicCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:32:34,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:32:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-08 15:32:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-04-08 15:32:34,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:32:34,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,580 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,580 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:34,611 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-08 15:32:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-08 15:32:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:34,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-08 15:32:34,614 INFO L87 Difference]: Start difference. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-08 15:32:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:34,640 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-08 15:32:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-08 15:32:34,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:34,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:34,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:32:34,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:32:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1449 transitions. [2022-04-08 15:32:34,689 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1449 transitions. Word has length 131 [2022-04-08 15:32:34,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:32:34,689 INFO L478 AbstractCegarLoop]: Abstraction has 982 states and 1449 transitions. [2022-04-08 15:32:34,689 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:34,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 982 states and 1449 transitions. [2022-04-08 15:32:36,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1449 edges. 1449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-08 15:32:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 15:32:36,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:32:36,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:32:36,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 15:32:36,019 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:32:36,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:32:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 1 times [2022-04-08 15:32:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:36,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091244953] [2022-04-08 15:32:36,121 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:32:36,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:32:36,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 2 times [2022-04-08 15:32:36,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:32:36,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22635200] [2022-04-08 15:32:36,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:32:36,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:32:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:36,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:32:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:36,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {88841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88835#true} is VALID [2022-04-08 15:32:36,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {88835#true} assume true; {88835#true} is VALID [2022-04-08 15:32:36,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88835#true} {88835#true} #690#return; {88835#true} is VALID [2022-04-08 15:32:36,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {88835#true} call ULTIMATE.init(); {88841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:32:36,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {88841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88835#true} is VALID [2022-04-08 15:32:36,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {88835#true} assume true; {88835#true} is VALID [2022-04-08 15:32:36,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88835#true} {88835#true} #690#return; {88835#true} is VALID [2022-04-08 15:32:36,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {88835#true} call #t~ret161 := main(); {88835#true} is VALID [2022-04-08 15:32:36,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {88835#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88835#true} is VALID [2022-04-08 15:32:36,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {88835#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {88835#true} is VALID [2022-04-08 15:32:36,235 INFO L272 TraceCheckUtils]: 7: Hoare triple {88835#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88835#true} is VALID [2022-04-08 15:32:36,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {88835#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !false; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {88836#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 31: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {88836#false} assume 8496 == #t~mem58;havoc #t~mem58; {88836#false} is VALID [2022-04-08 15:32:36,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {88836#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {88836#false} assume !(1 == ~blastFlag~0); {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {88836#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {88836#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {88836#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 54: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,243 INFO L290 TraceCheckUtils]: 55: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {88836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {88836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {88836#false} assume 8512 == #t~mem60;havoc #t~mem60; {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {88836#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {88836#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {88836#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 81: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 83: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,246 INFO L290 TraceCheckUtils]: 87: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 88: Hoare triple {88836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 89: Hoare triple {88836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 90: Hoare triple {88836#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {88836#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {88836#false} assume 8528 == #t~mem62;havoc #t~mem62; {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {88836#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {88836#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 95: Hoare triple {88836#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {88836#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {88836#false} is VALID [2022-04-08 15:32:36,247 INFO L290 TraceCheckUtils]: 97: Hoare triple {88836#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 98: Hoare triple {88836#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 99: Hoare triple {88836#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 100: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 101: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 102: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 103: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 104: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 105: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 106: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 107: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,248 INFO L290 TraceCheckUtils]: 108: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 109: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 110: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 111: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 112: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 113: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 114: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 115: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 116: Hoare triple {88836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 117: Hoare triple {88836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 118: Hoare triple {88836#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 119: Hoare triple {88836#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,249 INFO L290 TraceCheckUtils]: 120: Hoare triple {88836#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 121: Hoare triple {88836#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 122: Hoare triple {88836#false} assume 8544 == #t~mem64;havoc #t~mem64; {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 123: Hoare triple {88836#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 124: Hoare triple {88836#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 125: Hoare triple {88836#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 126: Hoare triple {88836#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 127: Hoare triple {88836#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 128: Hoare triple {88836#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 129: Hoare triple {88836#false} assume 8 == ~blastFlag~0; {88836#false} is VALID [2022-04-08 15:32:36,250 INFO L290 TraceCheckUtils]: 130: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-08 15:32:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-08 15:32:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:32:36,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22635200] [2022-04-08 15:32:36,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22635200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:36,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:36,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:36,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:32:36,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091244953] [2022-04-08 15:32:36,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091244953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:36,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:36,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085963443] [2022-04-08 15:32:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:32:36,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:36,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:32:36,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:36,321 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-08 15:32:36,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:32:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:36,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:32:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:32:36,322 INFO L87 Difference]: Start difference. First operand 982 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:38,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:43,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:43,497 INFO L93 Difference]: Finished difference Result 1940 states and 2871 transitions. [2022-04-08 15:32:43,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:32:43,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-08 15:32:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:32:43,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-08 15:32:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-08 15:32:43,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-08 15:32:43,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:43,814 INFO L225 Difference]: With dead ends: 1940 [2022-04-08 15:32:43,814 INFO L226 Difference]: Without dead ends: 984 [2022-04-08 15:32:43,815 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-08 15:32:43,816 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 15:32:43,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 15:32:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-04-08 15:32:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2022-04-08 15:32:43,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:32:43,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,868 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,868 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:43,894 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-08 15:32:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-08 15:32:43,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:43,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:43,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-08 15:32:43,896 INFO L87 Difference]: Start difference. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-08 15:32:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:43,922 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-08 15:32:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-08 15:32:43,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:43,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:43,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:32:43,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:32:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1451 transitions. [2022-04-08 15:32:43,971 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1451 transitions. Word has length 131 [2022-04-08 15:32:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:32:43,971 INFO L478 AbstractCegarLoop]: Abstraction has 984 states and 1451 transitions. [2022-04-08 15:32:43,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:43,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 984 states and 1451 transitions. [2022-04-08 15:32:45,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1451 edges. 1451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-08 15:32:45,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 15:32:45,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:32:45,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:32:45,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-08 15:32:45,305 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:32:45,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:32:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 1 times [2022-04-08 15:32:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:45,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506736822] [2022-04-08 15:32:45,393 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:32:45,393 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:32:45,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 2 times [2022-04-08 15:32:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:32:45,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741552669] [2022-04-08 15:32:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:32:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:32:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:45,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:32:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:45,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {96666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96660#true} is VALID [2022-04-08 15:32:45,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {96660#true} assume true; {96660#true} is VALID [2022-04-08 15:32:45,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96660#true} {96660#true} #690#return; {96660#true} is VALID [2022-04-08 15:32:45,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {96660#true} call ULTIMATE.init(); {96666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:32:45,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {96666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96660#true} is VALID [2022-04-08 15:32:45,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {96660#true} assume true; {96660#true} is VALID [2022-04-08 15:32:45,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96660#true} {96660#true} #690#return; {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {96660#true} call #t~ret161 := main(); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {96660#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {96660#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L272 TraceCheckUtils]: 7: Hoare triple {96660#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {96660#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {96660#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {96660#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {96660#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {96660#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {96660#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {96660#true} assume !false; {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {96660#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {96660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {96660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {96660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {96660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {96660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {96660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {96660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {96660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {96660#true} assume 8464 == #t~mem55;havoc #t~mem55; {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {96660#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {96660#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {96660#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {96660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {96660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {96660#true} ~skip~0 := 0; {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {96660#true} assume !false; {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {96660#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {96660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {96660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {96660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {96660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {96660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {96660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {96660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {96660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 41: Hoare triple {96660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 42: Hoare triple {96660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 43: Hoare triple {96660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 44: Hoare triple {96660#true} assume 8496 == #t~mem58;havoc #t~mem58; {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {96660#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96660#true} is VALID [2022-04-08 15:32:45,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {96660#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 47: Hoare triple {96660#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 48: Hoare triple {96660#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {96660#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {96660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 51: Hoare triple {96660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 52: Hoare triple {96660#true} ~skip~0 := 0; {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 53: Hoare triple {96660#true} assume !false; {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 54: Hoare triple {96660#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,551 INFO L290 TraceCheckUtils]: 55: Hoare triple {96660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 56: Hoare triple {96660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 57: Hoare triple {96660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 58: Hoare triple {96660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {96660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {96660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {96660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {96660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 63: Hoare triple {96660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 64: Hoare triple {96660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,552 INFO L290 TraceCheckUtils]: 65: Hoare triple {96660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,553 INFO L290 TraceCheckUtils]: 66: Hoare triple {96660#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,553 INFO L290 TraceCheckUtils]: 67: Hoare triple {96660#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-08 15:32:45,553 INFO L290 TraceCheckUtils]: 68: Hoare triple {96660#true} assume 8512 == #t~mem60;havoc #t~mem60; {96660#true} is VALID [2022-04-08 15:32:45,553 INFO L290 TraceCheckUtils]: 69: Hoare triple {96660#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {96660#true} is VALID [2022-04-08 15:32:45,553 INFO L290 TraceCheckUtils]: 70: Hoare triple {96660#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96660#true} is VALID [2022-04-08 15:32:45,553 INFO L290 TraceCheckUtils]: 71: Hoare triple {96660#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,554 INFO L290 TraceCheckUtils]: 72: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,554 INFO L290 TraceCheckUtils]: 73: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,554 INFO L290 TraceCheckUtils]: 74: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,555 INFO L290 TraceCheckUtils]: 75: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,555 INFO L290 TraceCheckUtils]: 76: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,555 INFO L290 TraceCheckUtils]: 77: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,556 INFO L290 TraceCheckUtils]: 78: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,556 INFO L290 TraceCheckUtils]: 79: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,556 INFO L290 TraceCheckUtils]: 80: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,557 INFO L290 TraceCheckUtils]: 81: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,557 INFO L290 TraceCheckUtils]: 82: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,557 INFO L290 TraceCheckUtils]: 83: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,557 INFO L290 TraceCheckUtils]: 84: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,558 INFO L290 TraceCheckUtils]: 85: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,558 INFO L290 TraceCheckUtils]: 86: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,558 INFO L290 TraceCheckUtils]: 87: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,559 INFO L290 TraceCheckUtils]: 88: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,559 INFO L290 TraceCheckUtils]: 89: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,559 INFO L290 TraceCheckUtils]: 90: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,559 INFO L290 TraceCheckUtils]: 91: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,560 INFO L290 TraceCheckUtils]: 92: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,560 INFO L290 TraceCheckUtils]: 93: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,560 INFO L290 TraceCheckUtils]: 94: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,561 INFO L290 TraceCheckUtils]: 95: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,561 INFO L290 TraceCheckUtils]: 96: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,561 INFO L290 TraceCheckUtils]: 97: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,562 INFO L290 TraceCheckUtils]: 98: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,562 INFO L290 TraceCheckUtils]: 99: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,562 INFO L290 TraceCheckUtils]: 100: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,562 INFO L290 TraceCheckUtils]: 101: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,563 INFO L290 TraceCheckUtils]: 102: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,563 INFO L290 TraceCheckUtils]: 103: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,563 INFO L290 TraceCheckUtils]: 104: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,564 INFO L290 TraceCheckUtils]: 105: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,564 INFO L290 TraceCheckUtils]: 106: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,564 INFO L290 TraceCheckUtils]: 107: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,565 INFO L290 TraceCheckUtils]: 108: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,565 INFO L290 TraceCheckUtils]: 109: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,565 INFO L290 TraceCheckUtils]: 110: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,565 INFO L290 TraceCheckUtils]: 111: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,566 INFO L290 TraceCheckUtils]: 112: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,566 INFO L290 TraceCheckUtils]: 113: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,566 INFO L290 TraceCheckUtils]: 114: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,567 INFO L290 TraceCheckUtils]: 115: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,567 INFO L290 TraceCheckUtils]: 116: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,567 INFO L290 TraceCheckUtils]: 117: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,568 INFO L290 TraceCheckUtils]: 118: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,568 INFO L290 TraceCheckUtils]: 119: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,568 INFO L290 TraceCheckUtils]: 120: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,568 INFO L290 TraceCheckUtils]: 121: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,569 INFO L290 TraceCheckUtils]: 122: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,569 INFO L290 TraceCheckUtils]: 123: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,569 INFO L290 TraceCheckUtils]: 124: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,570 INFO L290 TraceCheckUtils]: 125: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,570 INFO L290 TraceCheckUtils]: 126: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,570 INFO L290 TraceCheckUtils]: 127: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,571 INFO L290 TraceCheckUtils]: 128: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,571 INFO L290 TraceCheckUtils]: 129: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-08 15:32:45,572 INFO L290 TraceCheckUtils]: 131: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {96661#false} is VALID [2022-04-08 15:32:45,572 INFO L290 TraceCheckUtils]: 132: Hoare triple {96661#false} assume !false; {96661#false} is VALID [2022-04-08 15:32:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 15:32:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:32:45,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741552669] [2022-04-08 15:32:45,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741552669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:45,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:45,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:45,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:32:45,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506736822] [2022-04-08 15:32:45,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506736822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:45,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:45,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689105101] [2022-04-08 15:32:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:32:45,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-08 15:32:45,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:32:45,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:45,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:45,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:32:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:45,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:32:45,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:32:45,644 INFO L87 Difference]: Start difference. First operand 984 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:47,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:50,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:32:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:52,303 INFO L93 Difference]: Finished difference Result 2407 states and 3569 transitions. [2022-04-08 15:32:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:32:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-08 15:32:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:32:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-08 15:32:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-08 15:32:52,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-08 15:32:52,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:52,787 INFO L225 Difference]: With dead ends: 2407 [2022-04-08 15:32:52,787 INFO L226 Difference]: Without dead ends: 1451 [2022-04-08 15:32:52,789 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-08 15:32:52,789 INFO L913 BasicCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 15:32:52,789 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 15:32:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-08 15:32:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-08 15:32:53,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:32:53,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:53,358 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:53,359 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:53,409 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-08 15:32:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-08 15:32:53,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:53,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:53,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-08 15:32:53,413 INFO L87 Difference]: Start difference. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-08 15:32:53,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:32:53,462 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-08 15:32:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-08 15:32:53,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:32:53,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:32:53,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:32:53,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:32:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2147 transitions. [2022-04-08 15:32:53,554 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2147 transitions. Word has length 133 [2022-04-08 15:32:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:32:53,554 INFO L478 AbstractCegarLoop]: Abstraction has 1449 states and 2147 transitions. [2022-04-08 15:32:53,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:53,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2147 transitions. [2022-04-08 15:32:55,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2147 transitions. [2022-04-08 15:32:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 15:32:55,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:32:55,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:32:55,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-08 15:32:55,607 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:32:55,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:32:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 1 times [2022-04-08 15:32:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:55,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1220491354] [2022-04-08 15:32:55,704 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:32:55,704 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:32:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 2 times [2022-04-08 15:32:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:32:55,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110621257] [2022-04-08 15:32:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:32:55,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:32:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:32:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:32:55,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {107289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {107283#true} is VALID [2022-04-08 15:32:55,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {107283#true} assume true; {107283#true} is VALID [2022-04-08 15:32:55,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107283#true} {107283#true} #690#return; {107283#true} is VALID [2022-04-08 15:32:55,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {107283#true} call ULTIMATE.init(); {107289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:32:55,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {107289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {107283#true} is VALID [2022-04-08 15:32:55,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {107283#true} assume true; {107283#true} is VALID [2022-04-08 15:32:55,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107283#true} {107283#true} #690#return; {107283#true} is VALID [2022-04-08 15:32:55,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {107283#true} call #t~ret161 := main(); {107283#true} is VALID [2022-04-08 15:32:55,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {107283#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {107283#true} is VALID [2022-04-08 15:32:55,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {107283#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L272 TraceCheckUtils]: 7: Hoare triple {107283#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {107283#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {107283#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {107283#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {107283#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {107283#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {107283#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {107283#true} assume 8464 == #t~mem55;havoc #t~mem55; {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {107283#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {107283#true} is VALID [2022-04-08 15:32:55,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {107283#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {107283#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {107283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {107283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {107283#true} ~skip~0 := 0; {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {107283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {107283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {107283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {107283#true} assume 8496 == #t~mem58;havoc #t~mem58; {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {107283#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {107283#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {107283#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {107283#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {107283#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {107283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {107283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {107283#true} ~skip~0 := 0; {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,857 INFO L290 TraceCheckUtils]: 55: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 56: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 59: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 63: Hoare triple {107283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 64: Hoare triple {107283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {107283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 66: Hoare triple {107283#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {107283#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {107283#true} assume 8512 == #t~mem60;havoc #t~mem60; {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {107283#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {107283#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {107283#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {107283#true} assume !(~ret~0 <= 0); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {107283#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {107283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {107283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107283#true} is VALID [2022-04-08 15:32:55,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {107283#true} ~skip~0 := 0; {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 77: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 78: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 79: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 80: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 81: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 85: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 87: Hoare triple {107283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 88: Hoare triple {107283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 89: Hoare triple {107283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {107283#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {107283#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {107283#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 93: Hoare triple {107283#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {107283#true} assume 8528 == #t~mem62;havoc #t~mem62; {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 95: Hoare triple {107283#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {107283#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {107283#true} is VALID [2022-04-08 15:32:55,861 INFO L290 TraceCheckUtils]: 97: Hoare triple {107283#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {107283#true} is VALID [2022-04-08 15:32:55,862 INFO L290 TraceCheckUtils]: 98: Hoare triple {107283#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {107283#true} is VALID [2022-04-08 15:32:55,862 INFO L290 TraceCheckUtils]: 99: Hoare triple {107283#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {107283#true} is VALID [2022-04-08 15:32:55,862 INFO L290 TraceCheckUtils]: 100: Hoare triple {107283#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,863 INFO L290 TraceCheckUtils]: 101: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,863 INFO L290 TraceCheckUtils]: 102: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,863 INFO L290 TraceCheckUtils]: 103: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,864 INFO L290 TraceCheckUtils]: 104: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,864 INFO L290 TraceCheckUtils]: 105: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,864 INFO L290 TraceCheckUtils]: 106: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,864 INFO L290 TraceCheckUtils]: 107: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,865 INFO L290 TraceCheckUtils]: 108: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,865 INFO L290 TraceCheckUtils]: 109: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,865 INFO L290 TraceCheckUtils]: 110: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,866 INFO L290 TraceCheckUtils]: 111: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,866 INFO L290 TraceCheckUtils]: 112: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,866 INFO L290 TraceCheckUtils]: 113: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,867 INFO L290 TraceCheckUtils]: 114: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,867 INFO L290 TraceCheckUtils]: 115: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,867 INFO L290 TraceCheckUtils]: 116: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,868 INFO L290 TraceCheckUtils]: 117: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,868 INFO L290 TraceCheckUtils]: 118: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,868 INFO L290 TraceCheckUtils]: 119: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,869 INFO L290 TraceCheckUtils]: 120: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,869 INFO L290 TraceCheckUtils]: 121: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,869 INFO L290 TraceCheckUtils]: 122: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,870 INFO L290 TraceCheckUtils]: 123: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,870 INFO L290 TraceCheckUtils]: 124: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,870 INFO L290 TraceCheckUtils]: 125: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,870 INFO L290 TraceCheckUtils]: 126: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,871 INFO L290 TraceCheckUtils]: 127: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,871 INFO L290 TraceCheckUtils]: 128: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,871 INFO L290 TraceCheckUtils]: 129: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,872 INFO L290 TraceCheckUtils]: 130: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,872 INFO L290 TraceCheckUtils]: 131: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-08 15:32:55,873 INFO L290 TraceCheckUtils]: 132: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {107284#false} is VALID [2022-04-08 15:32:55,873 INFO L290 TraceCheckUtils]: 133: Hoare triple {107284#false} assume !false; {107284#false} is VALID [2022-04-08 15:32:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 15:32:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:32:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110621257] [2022-04-08 15:32:55,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110621257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:55,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:32:55,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1220491354] [2022-04-08 15:32:55,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1220491354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:32:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:32:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:32:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826968000] [2022-04-08 15:32:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:32:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-08 15:32:55,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:32:55,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:55,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:32:55,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:32:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:32:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:32:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:32:55,948 INFO L87 Difference]: Start difference. First operand 1449 states and 2147 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:32:57,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:33:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:00,040 INFO L93 Difference]: Finished difference Result 1918 states and 2847 transitions. [2022-04-08 15:33:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:33:00,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-08 15:33:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:33:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-08 15:33:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-08 15:33:00,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-08 15:33:00,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:33:00,478 INFO L225 Difference]: With dead ends: 1918 [2022-04-08 15:33:00,478 INFO L226 Difference]: Without dead ends: 1916 [2022-04-08 15:33:00,478 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-08 15:33:00,478 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:33:00,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:33:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-04-08 15:33:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2022-04-08 15:33:01,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:33:01,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1916 states. Second operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:01,677 INFO L74 IsIncluded]: Start isIncluded. First operand 1916 states. Second operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:01,678 INFO L87 Difference]: Start difference. First operand 1916 states. Second operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:01,769 INFO L93 Difference]: Finished difference Result 1916 states and 2845 transitions. [2022-04-08 15:33:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2845 transitions. [2022-04-08 15:33:01,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:33:01,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:33:01,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1916 states. [2022-04-08 15:33:01,775 INFO L87 Difference]: Start difference. First operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1916 states. [2022-04-08 15:33:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:01,867 INFO L93 Difference]: Finished difference Result 1916 states and 2845 transitions. [2022-04-08 15:33:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2845 transitions. [2022-04-08 15:33:01,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:33:01,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:33:01,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:33:01,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:33:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2844 transitions. [2022-04-08 15:33:02,036 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2844 transitions. Word has length 134 [2022-04-08 15:33:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:33:02,036 INFO L478 AbstractCegarLoop]: Abstraction has 1914 states and 2844 transitions. [2022-04-08 15:33:02,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:02,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1914 states and 2844 transitions. [2022-04-08 15:33:04,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2844 edges. 2844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:33:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2844 transitions. [2022-04-08 15:33:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-08 15:33:04,820 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:33:04,820 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, 1, 1] [2022-04-08 15:33:04,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-08 15:33:04,820 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:33:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:33:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2033004629, now seen corresponding path program 1 times [2022-04-08 15:33:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:33:04,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1434085319] [2022-04-08 15:33:04,911 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:33:04,911 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:33:04,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2033004629, now seen corresponding path program 2 times [2022-04-08 15:33:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:33:04,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580340831] [2022-04-08 15:33:04,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:33:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:33:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:33:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:33:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:33:05,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {118794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {118788#true} is VALID [2022-04-08 15:33:05,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {118788#true} assume true; {118788#true} is VALID [2022-04-08 15:33:05,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118788#true} {118788#true} #690#return; {118788#true} is VALID [2022-04-08 15:33:05,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {118788#true} call ULTIMATE.init(); {118794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:33:05,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {118794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {118788#true} is VALID [2022-04-08 15:33:05,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {118788#true} assume true; {118788#true} is VALID [2022-04-08 15:33:05,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118788#true} {118788#true} #690#return; {118788#true} is VALID [2022-04-08 15:33:05,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {118788#true} call #t~ret161 := main(); {118788#true} is VALID [2022-04-08 15:33:05,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {118788#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {118788#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L272 TraceCheckUtils]: 7: Hoare triple {118788#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {118788#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {118788#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {118788#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {118788#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {118788#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {118788#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {118788#true} assume !false; {118788#true} is VALID [2022-04-08 15:33:05,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {118788#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {118788#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {118788#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {118788#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {118788#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {118788#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {118788#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {118788#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {118788#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {118788#true} assume 8464 == #t~mem55;havoc #t~mem55; {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {118788#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {118788#true} is VALID [2022-04-08 15:33:05,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {118788#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {118788#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {118788#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {118788#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {118788#true} ~skip~0 := 0; {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {118788#true} assume !false; {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {118788#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {118788#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {118788#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {118788#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {118788#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {118788#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {118788#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {118788#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {118788#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {118788#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {118788#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {118788#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {118788#true} assume 8496 == #t~mem58;havoc #t~mem58; {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {118788#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {118788#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {118788#true} is VALID [2022-04-08 15:33:05,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {118788#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {118788#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {118788#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {118788#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {118788#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {118788#true} ~skip~0 := 0; {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {118788#true} assume !false; {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {118788#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {118788#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {118788#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {118788#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {118788#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {118788#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {118788#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 61: Hoare triple {118788#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {118788#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {118788#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {118788#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {118788#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {118788#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {118788#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-08 15:33:05,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {118788#true} assume 8512 == #t~mem60;havoc #t~mem60; {118788#true} is VALID [2022-04-08 15:33:05,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {118788#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {118788#true} is VALID [2022-04-08 15:33:05,045 INFO L290 TraceCheckUtils]: 70: Hoare triple {118788#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {118788#true} is VALID [2022-04-08 15:33:05,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {118788#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,046 INFO L290 TraceCheckUtils]: 72: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,046 INFO L290 TraceCheckUtils]: 74: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,046 INFO L290 TraceCheckUtils]: 75: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,047 INFO L290 TraceCheckUtils]: 76: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,047 INFO L290 TraceCheckUtils]: 77: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !false; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,047 INFO L290 TraceCheckUtils]: 78: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,048 INFO L290 TraceCheckUtils]: 79: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,048 INFO L290 TraceCheckUtils]: 80: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,048 INFO L290 TraceCheckUtils]: 81: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,049 INFO L290 TraceCheckUtils]: 82: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,049 INFO L290 TraceCheckUtils]: 83: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,049 INFO L290 TraceCheckUtils]: 84: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,049 INFO L290 TraceCheckUtils]: 85: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,050 INFO L290 TraceCheckUtils]: 86: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,050 INFO L290 TraceCheckUtils]: 87: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,050 INFO L290 TraceCheckUtils]: 88: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,051 INFO L290 TraceCheckUtils]: 89: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,051 INFO L290 TraceCheckUtils]: 90: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,051 INFO L290 TraceCheckUtils]: 91: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,052 INFO L290 TraceCheckUtils]: 93: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,052 INFO L290 TraceCheckUtils]: 94: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,052 INFO L290 TraceCheckUtils]: 95: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,053 INFO L290 TraceCheckUtils]: 96: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,053 INFO L290 TraceCheckUtils]: 97: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,054 INFO L290 TraceCheckUtils]: 99: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,054 INFO L290 TraceCheckUtils]: 100: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,055 INFO L290 TraceCheckUtils]: 102: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,055 INFO L290 TraceCheckUtils]: 103: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,055 INFO L290 TraceCheckUtils]: 104: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,055 INFO L290 TraceCheckUtils]: 105: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,059 INFO L290 TraceCheckUtils]: 106: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume 8609 == #t~mem74;havoc #t~mem74; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,060 INFO L290 TraceCheckUtils]: 107: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-08 15:33:05,060 INFO L290 TraceCheckUtils]: 108: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {118789#false} is VALID [2022-04-08 15:33:05,060 INFO L290 TraceCheckUtils]: 109: Hoare triple {118789#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,060 INFO L290 TraceCheckUtils]: 110: Hoare triple {118789#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,060 INFO L290 TraceCheckUtils]: 111: Hoare triple {118789#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 112: Hoare triple {118789#false} ~skip~0 := 0; {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 113: Hoare triple {118789#false} assume !false; {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 114: Hoare triple {118789#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 115: Hoare triple {118789#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 116: Hoare triple {118789#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 117: Hoare triple {118789#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 118: Hoare triple {118789#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 119: Hoare triple {118789#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 120: Hoare triple {118789#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 121: Hoare triple {118789#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,061 INFO L290 TraceCheckUtils]: 122: Hoare triple {118789#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 123: Hoare triple {118789#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 124: Hoare triple {118789#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 125: Hoare triple {118789#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 126: Hoare triple {118789#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 127: Hoare triple {118789#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 128: Hoare triple {118789#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 129: Hoare triple {118789#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 130: Hoare triple {118789#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 131: Hoare triple {118789#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,062 INFO L290 TraceCheckUtils]: 132: Hoare triple {118789#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 133: Hoare triple {118789#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 134: Hoare triple {118789#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 135: Hoare triple {118789#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 136: Hoare triple {118789#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 137: Hoare triple {118789#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 138: Hoare triple {118789#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 139: Hoare triple {118789#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 140: Hoare triple {118789#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 141: Hoare triple {118789#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,063 INFO L290 TraceCheckUtils]: 142: Hoare triple {118789#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-08 15:33:05,064 INFO L290 TraceCheckUtils]: 143: Hoare triple {118789#false} assume 8640 == #t~mem75;havoc #t~mem75; {118789#false} is VALID [2022-04-08 15:33:05,064 INFO L290 TraceCheckUtils]: 144: Hoare triple {118789#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {118789#false} is VALID [2022-04-08 15:33:05,064 INFO L290 TraceCheckUtils]: 145: Hoare triple {118789#false} assume 4 == ~blastFlag~0; {118789#false} is VALID [2022-04-08 15:33:05,064 INFO L290 TraceCheckUtils]: 146: Hoare triple {118789#false} assume !false; {118789#false} is VALID [2022-04-08 15:33:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 15:33:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:33:05,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580340831] [2022-04-08 15:33:05,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580340831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:33:05,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:33:05,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:33:05,065 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:33:05,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1434085319] [2022-04-08 15:33:05,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1434085319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:33:05,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:33:05,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:33:05,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931602974] [2022-04-08 15:33:05,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:33:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-08 15:33:05,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:33:05,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:05,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:33:05,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:33:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:33:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:33:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:33:05,155 INFO L87 Difference]: Start difference. First operand 1914 states and 2844 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:08,062 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-08 15:33:10,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:33:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:16,085 INFO L93 Difference]: Finished difference Result 4267 states and 6353 transitions. [2022-04-08 15:33:16,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:33:16,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-08 15:33:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:33:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-08 15:33:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-08 15:33:16,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 605 transitions. [2022-04-08 15:33:16,481 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-08 15:33:16,720 INFO L225 Difference]: With dead ends: 4267 [2022-04-08 15:33:16,720 INFO L226 Difference]: Without dead ends: 2381 [2022-04-08 15:33:16,722 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-08 15:33:16,723 INFO L913 BasicCegarLoop]: 382 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 15:33:16,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 576 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 427 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 15:33:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2022-04-08 15:33:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2379. [2022-04-08 15:33:18,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:33:18,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2381 states. Second operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:18,913 INFO L74 IsIncluded]: Start isIncluded. First operand 2381 states. Second operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:18,914 INFO L87 Difference]: Start difference. First operand 2381 states. Second operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:19,050 INFO L93 Difference]: Finished difference Result 2381 states and 3520 transitions. [2022-04-08 15:33:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3520 transitions. [2022-04-08 15:33:19,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:33:19,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:33:19,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2381 states. [2022-04-08 15:33:19,056 INFO L87 Difference]: Start difference. First operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2381 states. [2022-04-08 15:33:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:19,194 INFO L93 Difference]: Finished difference Result 2381 states and 3520 transitions. [2022-04-08 15:33:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3520 transitions. [2022-04-08 15:33:19,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:33:19,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:33:19,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:33:19,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:33:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3519 transitions. [2022-04-08 15:33:19,452 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3519 transitions. Word has length 147 [2022-04-08 15:33:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:33:19,453 INFO L478 AbstractCegarLoop]: Abstraction has 2379 states and 3519 transitions. [2022-04-08 15:33:19,453 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:19,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2379 states and 3519 transitions. [2022-04-08 15:33:22,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3519 edges. 3519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:33:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3519 transitions. [2022-04-08 15:33:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-08 15:33:22,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:33:22,886 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-08 15:33:22,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-08 15:33:22,886 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:33:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:33:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2118197421, now seen corresponding path program 1 times [2022-04-08 15:33:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:33:22,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480606499] [2022-04-08 15:33:22,998 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:33:22,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:33:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2118197421, now seen corresponding path program 2 times [2022-04-08 15:33:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:33:22,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080570421] [2022-04-08 15:33:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:33:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:33:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:33:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:33:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:33:23,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {136858#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {136851#true} is VALID [2022-04-08 15:33:23,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {136851#true} assume true; {136851#true} is VALID [2022-04-08 15:33:23,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136851#true} {136851#true} #690#return; {136851#true} is VALID [2022-04-08 15:33:23,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {136851#true} call ULTIMATE.init(); {136858#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:33:23,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {136858#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {136851#true} is VALID [2022-04-08 15:33:23,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {136851#true} assume true; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136851#true} {136851#true} #690#return; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {136851#true} call #t~ret161 := main(); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {136851#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {136851#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L272 TraceCheckUtils]: 7: Hoare triple {136851#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {136851#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {136851#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {136851#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {136851#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {136851#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {136851#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {136851#true} assume !false; {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {136851#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {136851#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {136851#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {136851#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {136851#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {136851#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {136851#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {136851#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {136851#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {136851#true} assume 8464 == #t~mem55;havoc #t~mem55; {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {136851#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {136851#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {136851#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {136851#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {136851#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136851#true} is VALID [2022-04-08 15:33:23,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {136851#true} ~skip~0 := 0; {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {136851#true} assume !false; {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {136851#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {136851#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {136851#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {136851#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 36: Hoare triple {136851#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 37: Hoare triple {136851#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {136851#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {136851#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {136851#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {136851#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {136851#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {136851#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {136851#true} assume 8496 == #t~mem58;havoc #t~mem58; {136851#true} is VALID [2022-04-08 15:33:23,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {136851#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {136851#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {136851#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {136851#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {136851#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {136851#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {136851#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 52: Hoare triple {136851#true} ~skip~0 := 0; {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {136851#true} assume !false; {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {136851#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {136851#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {136851#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {136851#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {136851#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {136851#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 60: Hoare triple {136851#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 61: Hoare triple {136851#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 62: Hoare triple {136851#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 63: Hoare triple {136851#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 64: Hoare triple {136851#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {136851#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {136851#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {136851#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {136851#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {136851#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {136851#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {136851#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {136851#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {136851#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 74: Hoare triple {136851#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {136851#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {136851#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {136851#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {136851#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {136851#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {136851#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {136851#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {136851#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {136851#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {136851#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-08 15:33:23,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {136851#true} assume 8656 == #t~mem77;havoc #t~mem77; {136851#true} is VALID [2022-04-08 15:33:23,142 INFO L290 TraceCheckUtils]: 86: Hoare triple {136851#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {136851#true} is VALID [2022-04-08 15:33:23,142 INFO L290 TraceCheckUtils]: 87: Hoare triple {136851#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {136851#true} is VALID [2022-04-08 15:33:23,142 INFO L290 TraceCheckUtils]: 88: Hoare triple {136851#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {136851#true} is VALID [2022-04-08 15:33:23,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {136851#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(0 == ~tmp___10~0); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,144 INFO L290 TraceCheckUtils]: 91: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,144 INFO L290 TraceCheckUtils]: 92: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} ~skip~0 := 0; {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !false; {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,146 INFO L290 TraceCheckUtils]: 97: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,146 INFO L290 TraceCheckUtils]: 98: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,146 INFO L290 TraceCheckUtils]: 99: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,147 INFO L290 TraceCheckUtils]: 100: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,147 INFO L290 TraceCheckUtils]: 101: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,148 INFO L290 TraceCheckUtils]: 102: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,148 INFO L290 TraceCheckUtils]: 103: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,148 INFO L290 TraceCheckUtils]: 104: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,149 INFO L290 TraceCheckUtils]: 105: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,149 INFO L290 TraceCheckUtils]: 106: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,149 INFO L290 TraceCheckUtils]: 107: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,150 INFO L290 TraceCheckUtils]: 110: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,151 INFO L290 TraceCheckUtils]: 111: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,151 INFO L290 TraceCheckUtils]: 112: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,152 INFO L290 TraceCheckUtils]: 113: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,152 INFO L290 TraceCheckUtils]: 114: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,152 INFO L290 TraceCheckUtils]: 115: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,153 INFO L290 TraceCheckUtils]: 116: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,153 INFO L290 TraceCheckUtils]: 117: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,153 INFO L290 TraceCheckUtils]: 118: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,154 INFO L290 TraceCheckUtils]: 119: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,154 INFO L290 TraceCheckUtils]: 120: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,155 INFO L290 TraceCheckUtils]: 121: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-08 15:33:23,155 INFO L290 TraceCheckUtils]: 122: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(= |ssl3_accept_#t~mem74| 8672)} is VALID [2022-04-08 15:33:23,155 INFO L290 TraceCheckUtils]: 123: Hoare triple {136857#(= |ssl3_accept_#t~mem74| 8672)} assume 8609 == #t~mem74;havoc #t~mem74; {136852#false} is VALID [2022-04-08 15:33:23,155 INFO L290 TraceCheckUtils]: 124: Hoare triple {136852#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {136852#false} is VALID [2022-04-08 15:33:23,155 INFO L290 TraceCheckUtils]: 125: Hoare triple {136852#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {136852#false} is VALID [2022-04-08 15:33:23,155 INFO L290 TraceCheckUtils]: 126: Hoare triple {136852#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 127: Hoare triple {136852#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 128: Hoare triple {136852#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 129: Hoare triple {136852#false} ~skip~0 := 0; {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 130: Hoare triple {136852#false} assume !false; {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 131: Hoare triple {136852#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 132: Hoare triple {136852#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 133: Hoare triple {136852#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 134: Hoare triple {136852#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 135: Hoare triple {136852#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 136: Hoare triple {136852#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 137: Hoare triple {136852#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 138: Hoare triple {136852#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 139: Hoare triple {136852#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,156 INFO L290 TraceCheckUtils]: 140: Hoare triple {136852#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 141: Hoare triple {136852#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 142: Hoare triple {136852#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 143: Hoare triple {136852#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 144: Hoare triple {136852#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 145: Hoare triple {136852#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 146: Hoare triple {136852#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 147: Hoare triple {136852#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 148: Hoare triple {136852#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 149: Hoare triple {136852#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 150: Hoare triple {136852#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 151: Hoare triple {136852#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 152: Hoare triple {136852#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 153: Hoare triple {136852#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 154: Hoare triple {136852#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,157 INFO L290 TraceCheckUtils]: 155: Hoare triple {136852#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 156: Hoare triple {136852#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 157: Hoare triple {136852#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 158: Hoare triple {136852#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 159: Hoare triple {136852#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 160: Hoare triple {136852#false} assume 8640 == #t~mem75;havoc #t~mem75; {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 161: Hoare triple {136852#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 162: Hoare triple {136852#false} assume 4 == ~blastFlag~0; {136852#false} is VALID [2022-04-08 15:33:23,158 INFO L290 TraceCheckUtils]: 163: Hoare triple {136852#false} assume !false; {136852#false} is VALID [2022-04-08 15:33:23,159 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-08 15:33:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:33:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080570421] [2022-04-08 15:33:23,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080570421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:33:23,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:33:23,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:33:23,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:33:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480606499] [2022-04-08 15:33:23,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480606499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:33:23,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:33:23,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:33:23,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297044732] [2022-04-08 15:33:23,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:33:23,160 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-08 15:33:23,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:33:23,161 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-08 15:33:23,253 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-08 15:33:23,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:33:23,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:33:23,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:33:23,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:33:23,254 INFO L87 Difference]: Start difference. First operand 2379 states and 3519 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-08 15:33:28,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:33:30,541 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:33:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:35,364 INFO L93 Difference]: Finished difference Result 5009 states and 7394 transitions. [2022-04-08 15:33:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:33:35,364 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-08 15:33:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:33:35,364 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-08 15:33:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-08 15:33:35,366 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-08 15:33:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-08 15:33:35,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 510 transitions. [2022-04-08 15:33:35,696 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-08 15:33:35,980 INFO L225 Difference]: With dead ends: 5009 [2022-04-08 15:33:35,981 INFO L226 Difference]: Without dead ends: 2658 [2022-04-08 15:33:35,983 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-08 15:33:35,984 INFO L913 BasicCegarLoop]: 257 mSDtfsCounter, 53 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:33:35,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 626 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-08 15:33:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-04-08 15:33:38,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2531. [2022-04-08 15:33:38,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:33:38,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2658 states. Second operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:38,351 INFO L74 IsIncluded]: Start isIncluded. First operand 2658 states. Second operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:38,353 INFO L87 Difference]: Start difference. First operand 2658 states. Second operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:38,525 INFO L93 Difference]: Finished difference Result 2658 states and 3903 transitions. [2022-04-08 15:33:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3903 transitions. [2022-04-08 15:33:38,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:33:38,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:33:38,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2658 states. [2022-04-08 15:33:38,531 INFO L87 Difference]: Start difference. First operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2658 states. [2022-04-08 15:33:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:33:38,702 INFO L93 Difference]: Finished difference Result 2658 states and 3903 transitions. [2022-04-08 15:33:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3903 transitions. [2022-04-08 15:33:38,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:33:38,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:33:38,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:33:38,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:33:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:33:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3747 transitions. [2022-04-08 15:33:38,984 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3747 transitions. Word has length 164 [2022-04-08 15:33:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:33:38,984 INFO L478 AbstractCegarLoop]: Abstraction has 2531 states and 3747 transitions. [2022-04-08 15:33:38,984 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-08 15:33:38,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2531 states and 3747 transitions. [2022-04-08 15:33:42,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3747 edges. 3747 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:33:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3747 transitions. [2022-04-08 15:33:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 15:33:42,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:33:42,697 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-08 15:33:42,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-08 15:33:42,697 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:33:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:33:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -210905305, now seen corresponding path program 1 times [2022-04-08 15:33:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:33:42,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873253147] [2022-04-08 15:33:42,824 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:33:42,824 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:33:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -210905305, now seen corresponding path program 2 times [2022-04-08 15:33:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:33:42,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760480051] [2022-04-08 15:33:42,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:33:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:33:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:33:43,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:33:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:33:43,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {157268#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {157259#true} is VALID [2022-04-08 15:33:43,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {157259#true} assume true; {157259#true} is VALID [2022-04-08 15:33:43,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157259#true} {157259#true} #690#return; {157259#true} is VALID [2022-04-08 15:33:43,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {157259#true} call ULTIMATE.init(); {157268#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:33:43,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {157268#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {157259#true} is VALID [2022-04-08 15:33:43,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {157259#true} assume true; {157259#true} is VALID [2022-04-08 15:33:43,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157259#true} {157259#true} #690#return; {157259#true} is VALID [2022-04-08 15:33:43,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {157259#true} call #t~ret161 := main(); {157259#true} is VALID [2022-04-08 15:33:43,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {157259#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {157259#true} is VALID [2022-04-08 15:33:43,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {157259#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {157264#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-08 15:33:43,368 INFO L272 TraceCheckUtils]: 7: Hoare triple {157264#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {157265#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-08 15:33:43,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {157265#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:33:43,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:33:43,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:33:43,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {157267#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {157267#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {157260#false} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {157260#false} assume 8464 == #t~mem55;havoc #t~mem55; {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {157260#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {157260#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {157260#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 44: Hoare triple {157260#false} assume 8496 == #t~mem58;havoc #t~mem58; {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {157260#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {157260#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {157260#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {157260#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {157260#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {157260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 67: Hoare triple {157260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 68: Hoare triple {157260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 69: Hoare triple {157260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {157260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,379 INFO L290 TraceCheckUtils]: 71: Hoare triple {157260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {157260#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {157260#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {157260#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 75: Hoare triple {157260#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 76: Hoare triple {157260#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 77: Hoare triple {157260#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 78: Hoare triple {157260#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 79: Hoare triple {157260#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 80: Hoare triple {157260#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,380 INFO L290 TraceCheckUtils]: 81: Hoare triple {157260#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 82: Hoare triple {157260#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {157260#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 84: Hoare triple {157260#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 85: Hoare triple {157260#false} assume 8656 == #t~mem77;havoc #t~mem77; {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 86: Hoare triple {157260#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 87: Hoare triple {157260#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 88: Hoare triple {157260#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 89: Hoare triple {157260#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 90: Hoare triple {157260#false} assume !(0 == ~tmp___10~0); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 91: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 92: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-08 15:33:43,381 INFO L290 TraceCheckUtils]: 93: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 94: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 95: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 96: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 97: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 98: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 99: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 100: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 101: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 102: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 103: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,382 INFO L290 TraceCheckUtils]: 104: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 105: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 106: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 107: Hoare triple {157260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 108: Hoare triple {157260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 109: Hoare triple {157260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 110: Hoare triple {157260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 111: Hoare triple {157260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 112: Hoare triple {157260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 113: Hoare triple {157260#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,383 INFO L290 TraceCheckUtils]: 114: Hoare triple {157260#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 115: Hoare triple {157260#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 116: Hoare triple {157260#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 117: Hoare triple {157260#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 118: Hoare triple {157260#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 119: Hoare triple {157260#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 120: Hoare triple {157260#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 121: Hoare triple {157260#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 122: Hoare triple {157260#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 123: Hoare triple {157260#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 124: Hoare triple {157260#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,384 INFO L290 TraceCheckUtils]: 125: Hoare triple {157260#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 126: Hoare triple {157260#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 127: Hoare triple {157260#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 128: Hoare triple {157260#false} assume 8672 == #t~mem79;havoc #t~mem79; {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 129: Hoare triple {157260#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 130: Hoare triple {157260#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 131: Hoare triple {157260#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 132: Hoare triple {157260#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 133: Hoare triple {157260#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 134: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 135: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-08 15:33:43,385 INFO L290 TraceCheckUtils]: 136: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 137: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 138: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 139: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 140: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 141: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 142: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 143: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 144: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 145: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 146: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,386 INFO L290 TraceCheckUtils]: 147: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 148: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 149: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 150: Hoare triple {157260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 151: Hoare triple {157260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 152: Hoare triple {157260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 153: Hoare triple {157260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 154: Hoare triple {157260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 155: Hoare triple {157260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 156: Hoare triple {157260#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 157: Hoare triple {157260#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,387 INFO L290 TraceCheckUtils]: 158: Hoare triple {157260#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 159: Hoare triple {157260#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 160: Hoare triple {157260#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 161: Hoare triple {157260#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 162: Hoare triple {157260#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 163: Hoare triple {157260#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 164: Hoare triple {157260#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 165: Hoare triple {157260#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 166: Hoare triple {157260#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 167: Hoare triple {157260#false} assume 8640 == #t~mem75;havoc #t~mem75; {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 168: Hoare triple {157260#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {157260#false} is VALID [2022-04-08 15:33:43,388 INFO L290 TraceCheckUtils]: 169: Hoare triple {157260#false} assume 4 == ~blastFlag~0; {157260#false} is VALID [2022-04-08 15:33:43,389 INFO L290 TraceCheckUtils]: 170: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-08 15:33:43,389 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-08 15:33:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:33:43,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760480051] [2022-04-08 15:33:43,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760480051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:33:43,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:33:43,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:33:43,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:33:43,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873253147] [2022-04-08 15:33:43,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873253147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:33:43,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:33:43,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 15:33:43,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634805054] [2022-04-08 15:33:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:33:43,391 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-08 15:33:43,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:33:43,391 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-08 15:33:43,451 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-08 15:33:43,451 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 15:33:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:33:43,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 15:33:43,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 15:33:43,452 INFO L87 Difference]: Start difference. First operand 2531 states and 3747 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-08 15:33:46,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:33:48,263 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-08 15:33:59,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 15:34:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:34:04,115 INFO L93 Difference]: Finished difference Result 5055 states and 7486 transitions. [2022-04-08 15:34:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 15:34:04,116 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-08 15:34:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:34:04,116 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-08 15:34:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-08 15:34:04,117 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-08 15:34:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-08 15:34:04,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-08 15:34:04,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:34:04,663 INFO L225 Difference]: With dead ends: 5055 [2022-04-08 15:34:04,663 INFO L226 Difference]: Without dead ends: 2531 [2022-04-08 15:34:04,666 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-08 15:34:04,666 INFO L913 BasicCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-08 15:34:04,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-04-08 15:34:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2022-04-08 15:34:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2022-04-08 15:34:07,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:34:07,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2531 states. Second operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:34:07,027 INFO L74 IsIncluded]: Start isIncluded. First operand 2531 states. Second operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:34:07,029 INFO L87 Difference]: Start difference. First operand 2531 states. Second operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:34:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:34:07,181 INFO L93 Difference]: Finished difference Result 2531 states and 3746 transitions. [2022-04-08 15:34:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3746 transitions. [2022-04-08 15:34:07,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:34:07,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:34:07,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2531 states. [2022-04-08 15:34:07,187 INFO L87 Difference]: Start difference. First operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2531 states. [2022-04-08 15:34:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:34:07,342 INFO L93 Difference]: Finished difference Result 2531 states and 3746 transitions. [2022-04-08 15:34:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3746 transitions. [2022-04-08 15:34:07,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:34:07,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:34:07,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:34:07,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:34:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:34:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3746 transitions. [2022-04-08 15:34:07,617 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3746 transitions. Word has length 171 [2022-04-08 15:34:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:34:07,617 INFO L478 AbstractCegarLoop]: Abstraction has 2531 states and 3746 transitions. [2022-04-08 15:34:07,618 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-08 15:34:07,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2531 states and 3746 transitions. [2022-04-08 15:34:11,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3746 edges. 3746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:34:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3746 transitions. [2022-04-08 15:34:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 15:34:11,309 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:34:11,309 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-08 15:34:11,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-08 15:34:11,309 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:34:11,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:34:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2134155735, now seen corresponding path program 1 times [2022-04-08 15:34:11,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:34:11,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2071541687] [2022-04-08 15:34:11,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-08 15:34:11,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:34:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2134155735, now seen corresponding path program 2 times [2022-04-08 15:34:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:34:11,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557967177] [2022-04-08 15:34:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:34:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:34:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:34:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:34:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:34:12,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {177524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {177511#true} is VALID [2022-04-08 15:34:12,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {177511#true} assume true; {177511#true} is VALID [2022-04-08 15:34:12,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177511#true} {177511#true} #690#return; {177511#true} is VALID [2022-04-08 15:34:12,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {177511#true} call ULTIMATE.init(); {177524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 15:34:12,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {177524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {177511#true} is VALID [2022-04-08 15:34:12,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {177511#true} assume true; {177511#true} is VALID [2022-04-08 15:34:12,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177511#true} {177511#true} #690#return; {177511#true} is VALID [2022-04-08 15:34:12,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {177511#true} call #t~ret161 := main(); {177511#true} is VALID [2022-04-08 15:34:12,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {177511#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {177516#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (= (select |#valid| main_~s~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} is VALID [2022-04-08 15:34:12,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {177516#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (= (select |#valid| main_~s~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 204 + ~s~0.offset, 8);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem28.base, 68 + #t~mem28.offset, 8);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {177517#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} is VALID [2022-04-08 15:34:12,433 INFO L272 TraceCheckUtils]: 7: Hoare triple {177517#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {177518#(and (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)))))} is VALID [2022-04-08 15:34:12,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {177518#(and (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |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 -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !false; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 8464 == #t~mem55;havoc #t~mem55; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} ~skip~0 := 0; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !false; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,461 INFO L290 TraceCheckUtils]: 43: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 8496 == #t~mem58;havoc #t~mem58; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,462 INFO L290 TraceCheckUtils]: 45: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,463 INFO L290 TraceCheckUtils]: 47: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,467 INFO L290 TraceCheckUtils]: 52: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} ~skip~0 := 0; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !false; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,482 INFO L290 TraceCheckUtils]: 75: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,484 INFO L290 TraceCheckUtils]: 77: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,484 INFO L290 TraceCheckUtils]: 78: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,486 INFO L290 TraceCheckUtils]: 80: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,486 INFO L290 TraceCheckUtils]: 81: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,487 INFO L290 TraceCheckUtils]: 82: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,487 INFO L290 TraceCheckUtils]: 83: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,488 INFO L290 TraceCheckUtils]: 84: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 8656 == #t~mem77;havoc #t~mem77; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-08 15:34:12,490 INFO L290 TraceCheckUtils]: 86: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,490 INFO L290 TraceCheckUtils]: 87: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,491 INFO L290 TraceCheckUtils]: 88: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,492 INFO L290 TraceCheckUtils]: 89: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,492 INFO L290 TraceCheckUtils]: 90: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == ~tmp___10~0); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,493 INFO L290 TraceCheckUtils]: 91: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,493 INFO L290 TraceCheckUtils]: 92: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,494 INFO L290 TraceCheckUtils]: 93: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} ~skip~0 := 0; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,494 INFO L290 TraceCheckUtils]: 94: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,495 INFO L290 TraceCheckUtils]: 95: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,495 INFO L290 TraceCheckUtils]: 96: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,496 INFO L290 TraceCheckUtils]: 97: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,496 INFO L290 TraceCheckUtils]: 98: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,497 INFO L290 TraceCheckUtils]: 99: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,497 INFO L290 TraceCheckUtils]: 101: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,498 INFO L290 TraceCheckUtils]: 103: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,499 INFO L290 TraceCheckUtils]: 104: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,500 INFO L290 TraceCheckUtils]: 106: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,500 INFO L290 TraceCheckUtils]: 107: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,501 INFO L290 TraceCheckUtils]: 108: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,501 INFO L290 TraceCheckUtils]: 109: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,502 INFO L290 TraceCheckUtils]: 110: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,502 INFO L290 TraceCheckUtils]: 111: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,503 INFO L290 TraceCheckUtils]: 112: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,503 INFO L290 TraceCheckUtils]: 113: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,504 INFO L290 TraceCheckUtils]: 114: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,504 INFO L290 TraceCheckUtils]: 115: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,505 INFO L290 TraceCheckUtils]: 116: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,505 INFO L290 TraceCheckUtils]: 117: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,506 INFO L290 TraceCheckUtils]: 118: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,506 INFO L290 TraceCheckUtils]: 119: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,507 INFO L290 TraceCheckUtils]: 120: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,507 INFO L290 TraceCheckUtils]: 121: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,508 INFO L290 TraceCheckUtils]: 122: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,508 INFO L290 TraceCheckUtils]: 123: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,509 INFO L290 TraceCheckUtils]: 124: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,509 INFO L290 TraceCheckUtils]: 125: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,510 INFO L290 TraceCheckUtils]: 126: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,510 INFO L290 TraceCheckUtils]: 127: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,511 INFO L290 TraceCheckUtils]: 128: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8672 == #t~mem79;havoc #t~mem79; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,511 INFO L290 TraceCheckUtils]: 129: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,512 INFO L290 TraceCheckUtils]: 130: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-08 15:34:12,513 INFO L290 TraceCheckUtils]: 131: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {177521#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-08 15:34:12,514 INFO L290 TraceCheckUtils]: 132: Hoare triple {177521#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,514 INFO L290 TraceCheckUtils]: 133: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,515 INFO L290 TraceCheckUtils]: 134: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,515 INFO L290 TraceCheckUtils]: 135: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,516 INFO L290 TraceCheckUtils]: 136: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,516 INFO L290 TraceCheckUtils]: 137: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,517 INFO L290 TraceCheckUtils]: 138: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,517 INFO L290 TraceCheckUtils]: 139: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,518 INFO L290 TraceCheckUtils]: 140: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,518 INFO L290 TraceCheckUtils]: 141: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,519 INFO L290 TraceCheckUtils]: 142: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,519 INFO L290 TraceCheckUtils]: 143: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,520 INFO L290 TraceCheckUtils]: 144: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,520 INFO L290 TraceCheckUtils]: 145: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,520 INFO L290 TraceCheckUtils]: 146: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,521 INFO L290 TraceCheckUtils]: 147: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,521 INFO L290 TraceCheckUtils]: 148: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,522 INFO L290 TraceCheckUtils]: 149: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,522 INFO L290 TraceCheckUtils]: 150: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,523 INFO L290 TraceCheckUtils]: 151: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,523 INFO L290 TraceCheckUtils]: 152: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,524 INFO L290 TraceCheckUtils]: 153: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,524 INFO L290 TraceCheckUtils]: 154: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,525 INFO L290 TraceCheckUtils]: 155: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,525 INFO L290 TraceCheckUtils]: 156: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,526 INFO L290 TraceCheckUtils]: 157: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,526 INFO L290 TraceCheckUtils]: 158: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 159: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {177523#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 160: Hoare triple {177523#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 161: Hoare triple {177512#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 162: Hoare triple {177512#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 163: Hoare triple {177512#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 164: Hoare triple {177512#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 165: Hoare triple {177512#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,527 INFO L290 TraceCheckUtils]: 166: Hoare triple {177512#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-08 15:34:12,528 INFO L290 TraceCheckUtils]: 167: Hoare triple {177512#false} assume 8640 == #t~mem75;havoc #t~mem75; {177512#false} is VALID [2022-04-08 15:34:12,528 INFO L290 TraceCheckUtils]: 168: Hoare triple {177512#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {177512#false} is VALID [2022-04-08 15:34:12,528 INFO L290 TraceCheckUtils]: 169: Hoare triple {177512#false} assume 4 == ~blastFlag~0; {177512#false} is VALID [2022-04-08 15:34:12,528 INFO L290 TraceCheckUtils]: 170: Hoare triple {177512#false} assume !false; {177512#false} is VALID [2022-04-08 15:34:12,529 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-08 15:34:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:34:12,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557967177] [2022-04-08 15:34:12,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557967177] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 15:34:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356266775] [2022-04-08 15:34:12,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 15:34:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 15:34:12,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:34:12,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 15:34:12,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 15:34:49,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 15:34:49,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 15:34:49,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 232 conjunts are in the unsatisfiable core [2022-04-08 15:34:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:34:49,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 15:34:50,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-08 15:34:50,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82930 treesize of output 60426 [2022-04-08 15:34:50,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-08 15:34:50,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22065 treesize of output 5278 [2022-04-08 15:37:03,045 INFO L244 Elim1Store]: Index analysis took 415 ms [2022-04-08 15:37:06,584 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-08 15:37:06,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 15:37:06,784 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,SelfDestructingSolverStorable36 [2022-04-08 15:37:06,785 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_4 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:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) 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:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) 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:190) 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:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 15:37:06,791 INFO L158 Benchmark]: Toolchain (without parser) took 580799.42ms. Allocated memory was 180.4MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 127.0MB in the beginning and 830.6MB in the end (delta: -703.6MB). Peak memory consumption was 530.2MB. Max. memory is 8.0GB. [2022-04-08 15:37:06,791 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 145.8MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:37:06,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.22ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 126.8MB in the beginning and 171.1MB in the end (delta: -44.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-08 15:37:06,791 INFO L158 Benchmark]: Boogie Preprocessor took 146.53ms. Allocated memory is still 219.2MB. Free memory was 171.1MB in the beginning and 161.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 15:37:06,791 INFO L158 Benchmark]: RCFGBuilder took 1526.60ms. Allocated memory is still 219.2MB. Free memory was 161.3MB in the beginning and 139.6MB in the end (delta: 21.7MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. [2022-04-08 15:37:06,792 INFO L158 Benchmark]: TraceAbstraction took 578518.72ms. Allocated memory was 219.2MB in the beginning and 1.1GB in the end (delta: 871.4MB). Free memory was 139.0MB in the beginning and 830.6MB in the end (delta: -691.6MB). Peak memory consumption was 503.1MB. Max. memory is 8.0GB. [2022-04-08 15:37:06,793 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.14ms. Allocated memory is still 180.4MB. Free memory was 145.8MB in the beginning and 145.8MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 598.22ms. Allocated memory was 180.4MB in the beginning and 219.2MB in the end (delta: 38.8MB). Free memory was 126.8MB in the beginning and 171.1MB in the end (delta: -44.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 146.53ms. Allocated memory is still 219.2MB. Free memory was 171.1MB in the beginning and 161.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1526.60ms. Allocated memory is still 219.2MB. Free memory was 161.3MB in the beginning and 139.6MB in the end (delta: 21.7MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. * TraceAbstraction took 578518.72ms. Allocated memory was 219.2MB in the beginning and 1.1GB in the end (delta: 871.4MB). Free memory was 139.0MB in the beginning and 830.6MB in the end (delta: -691.6MB). Peak memory consumption was 503.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_4: 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-08 15:37:06,831 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...