/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.09.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:26:15,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:26:15,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:26:15,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:26:15,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:26:15,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:26:15,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:26:15,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:26:15,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:26:15,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:26:15,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:26:15,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:26:15,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:26:15,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:26:15,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:26:15,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:26:15,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:26:15,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:26:15,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:26:15,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:26:15,840 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:26:15,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:26:15,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:26:15,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:26:15,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:26:15,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:26:15,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:26:15,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:26:15,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:26:15,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:26:15,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:26:15,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:26:15,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:26:15,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:26:15,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:26:15,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:26:15,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:26:15,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:26:15,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:26:15,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:26:15,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:26:15,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:26:15,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 15:26:15,865 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:26:15,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:26:15,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:26:15,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:26:15,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:26:15,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:26:15,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:26:15,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:26:15,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:26:15,867 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:26:15,867 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:26:15,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:26:15,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:26:15,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:26:15,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:26:15,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:26:15,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:26:15,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:26:15,868 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:26:15,868 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:26:15,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:26:15,868 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:26:15,868 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 15:26:16,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:26:16,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:26:16,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:26:16,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:26:16,072 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:26:16,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-2.c [2022-04-28 15:26:16,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799dd6090/6877c1a91de646d6a2c3096a705f521e/FLAG81351d351 [2022-04-28 15:26:16,592 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:26:16,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-2.c [2022-04-28 15:26:16,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799dd6090/6877c1a91de646d6a2c3096a705f521e/FLAG81351d351 [2022-04-28 15:26:16,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799dd6090/6877c1a91de646d6a2c3096a705f521e [2022-04-28 15:26:16,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:26:16,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:26:16,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:26:16,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:26:16,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:26:16,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:26:16" (1/1) ... [2022-04-28 15:26:16,626 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b5ccc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:16, skipping insertion in model container [2022-04-28 15:26:16,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:26:16" (1/1) ... [2022-04-28 15:26:16,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:26:16,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:26:16,998 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.09.i.cil-2.c[74369,74382] [2022-04-28 15:26:17,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:26:17,012 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:26:17,133 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.09.i.cil-2.c[74369,74382] [2022-04-28 15:26:17,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:26:17,150 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:26:17,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17 WrapperNode [2022-04-28 15:26:17,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:26:17,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:26:17,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:26:17,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:26:17,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,230 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:26:17,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:26:17,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:26:17,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:26:17,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (1/1) ... [2022-04-28 15:26:17,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:26:17,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:26:17,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 15:26:17,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 15:26:17,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:26:17,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:26:17,310 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:26:17,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:26:17,310 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:26:17,311 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:26:17,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:26:17,311 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:26:17,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:26:17,311 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:26:17,311 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:26:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:26:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:26:17,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:26:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:26:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:26:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:26:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:26:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:26:17,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:26:17,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:26:17,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:26:17,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:26:18,184 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:26:18,643 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:26:18,643 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:26:18,653 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:26:18,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:26:18,662 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:26:18,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:26:18 BoogieIcfgContainer [2022-04-28 15:26:18,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:26:18,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:26:18,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:26:18,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:26:18,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:26:16" (1/3) ... [2022-04-28 15:26:18,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295e663e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:26:18, skipping insertion in model container [2022-04-28 15:26:18,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:26:17" (2/3) ... [2022-04-28 15:26:18,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295e663e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:26:18, skipping insertion in model container [2022-04-28 15:26:18,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:26:18" (3/3) ... [2022-04-28 15:26:18,669 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2022-04-28 15:26:18,682 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:26:18,682 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:26:18,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:26:18,743 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1770ab03, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5be27840 [2022-04-28 15:26:18,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:26:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 15:26:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 15:26:18,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:18,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:18,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 1 times [2022-04-28 15:26:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:18,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307911118] [2022-04-28 15:26:18,777 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:26:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1538020646, now seen corresponding path program 2 times [2022-04-28 15:26:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:18,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640859232] [2022-04-28 15:26:18,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:18,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:19,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-28 15:26:19,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:26:19,225 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 15:26:19,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:26:19,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {161#true} is VALID [2022-04-28 15:26:19,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:26:19,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #689#return; {161#true} is VALID [2022-04-28 15:26:19,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 15:26:19,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {161#true} is VALID [2022-04-28 15:26:19,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {161#true} is VALID [2022-04-28 15:26:19,229 INFO L272 TraceCheckUtils]: 7: Hoare triple {161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {161#true} is VALID [2022-04-28 15:26:19,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {161#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:19,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {167#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-28 15:26:19,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {167#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {162#false} is VALID [2022-04-28 15:26:19,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {162#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {162#false} is VALID [2022-04-28 15:26:19,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {162#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {162#false} is VALID [2022-04-28 15:26:19,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {162#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {162#false} is VALID [2022-04-28 15:26:19,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {162#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {162#false} is VALID [2022-04-28 15:26:19,255 INFO L290 TraceCheckUtils]: 38: Hoare triple {162#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {162#false} is VALID [2022-04-28 15:26:19,255 INFO L290 TraceCheckUtils]: 39: Hoare triple {162#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {162#false} is VALID [2022-04-28 15:26:19,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-28 15:26:19,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 15:26:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:26:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:19,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640859232] [2022-04-28 15:26:19,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640859232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:19,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:19,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:19,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:19,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307911118] [2022-04-28 15:26:19,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307911118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:19,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:19,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541000378] [2022-04-28 15:26:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:19,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 15:26:19,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:19,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:19,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:19,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:19,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:19,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:19,344 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:21,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:22,935 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-28 15:26:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:22,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 15:26:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 15:26:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 15:26:22,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-28 15:26:23,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 727 edges. 727 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:23,497 INFO L225 Difference]: With dead ends: 430 [2022-04-28 15:26:23,497 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 15:26:23,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:26:23,501 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:23,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 529 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 15:26:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 15:26:23,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-28 15:26:23,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:23,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:23,540 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:23,541 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:23,558 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 15:26:23,558 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 15:26:23,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:23,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:23,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 15:26:23,561 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 261 states. [2022-04-28 15:26:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:23,572 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 15:26:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 15:26:23,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:23,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:23,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:23,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.5818181818181818) internal successors, (261), 165 states have internal predecessors, (261), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 15:26:23,581 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 15:26:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:23,582 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 15:26:23,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:23,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 15:26:23,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 15:26:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 15:26:23,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:23,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:23,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:26:23,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 1 times [2022-04-28 15:26:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:23,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675311338] [2022-04-28 15:26:23,801 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:26:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1015183371, now seen corresponding path program 2 times [2022-04-28 15:26:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:23,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447353392] [2022-04-28 15:26:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:23,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:23,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-28 15:26:23,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 15:26:23,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #689#return; {1895#true} is VALID [2022-04-28 15:26:23,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:26:23,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1895#true} is VALID [2022-04-28 15:26:23,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 15:26:23,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #689#return; {1895#true} is VALID [2022-04-28 15:26:23,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret161 := main(); {1895#true} is VALID [2022-04-28 15:26:23,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {1895#true} is VALID [2022-04-28 15:26:23,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {1895#true} is VALID [2022-04-28 15:26:23,976 INFO L272 TraceCheckUtils]: 7: Hoare triple {1895#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1895#true} is VALID [2022-04-28 15:26:23,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,992 INFO L290 TraceCheckUtils]: 31: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:26:23,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {1900#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {1901#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-28 15:26:23,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {1901#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {1896#false} is VALID [2022-04-28 15:26:23,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {1896#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {1896#false} is VALID [2022-04-28 15:26:23,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {1896#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {1896#false} is VALID [2022-04-28 15:26:23,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {1896#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {1896#false} is VALID [2022-04-28 15:26:23,994 INFO L290 TraceCheckUtils]: 38: Hoare triple {1896#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {1896#false} is VALID [2022-04-28 15:26:23,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {1896#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {1896#false} is VALID [2022-04-28 15:26:23,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {1896#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {1896#false} is VALID [2022-04-28 15:26:23,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#false} assume 8 == ~blastFlag~0; {1896#false} is VALID [2022-04-28 15:26:23,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-28 15:26:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:26:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:23,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447353392] [2022-04-28 15:26:23,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447353392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:23,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:23,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:23,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:23,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675311338] [2022-04-28 15:26:23,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675311338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:23,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:23,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563368940] [2022-04-28 15:26:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 15:26:23,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:23,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:24,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:24,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:24,037 INFO L87 Difference]: Start difference. First operand 170 states and 265 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:27,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:31,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:33,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:34,837 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-28 15:26:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:34,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 15:26:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:26:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:26:34,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 15:26:35,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:35,279 INFO L225 Difference]: With dead ends: 444 [2022-04-28 15:26:35,279 INFO L226 Difference]: Without dead ends: 289 [2022-04-28 15:26:35,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:26:35,281 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:35,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 15:26:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-28 15:26:35,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-28 15:26:35,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:35,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:35,307 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:35,307 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:35,319 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 15:26:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 15:26:35,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:35,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:35,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 15:26:35,321 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 289 states. [2022-04-28 15:26:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:35,333 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 15:26:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 15:26:35,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:35,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:35,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:35,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 15:26:35,341 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 15:26:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:35,342 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 15:26:35,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:35,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 15:26:35,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:35,548 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 15:26:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 15:26:35,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:35,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:35,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:26:35,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:35,550 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 1 times [2022-04-28 15:26:35,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:35,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557305662] [2022-04-28 15:26:35,550 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:26:35,550 INFO L85 PathProgramCache]: Analyzing trace with hash 887448580, now seen corresponding path program 2 times [2022-04-28 15:26:35,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:35,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120059357] [2022-04-28 15:26:35,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:35,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:35,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-28 15:26:35,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 15:26:35,702 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #689#return; {3771#true} is VALID [2022-04-28 15:26:35,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {3771#true} call ULTIMATE.init(); {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:26:35,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3771#true} is VALID [2022-04-28 15:26:35,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 15:26:35,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #689#return; {3771#true} is VALID [2022-04-28 15:26:35,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret161 := main(); {3771#true} is VALID [2022-04-28 15:26:35,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {3771#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3771#true} is VALID [2022-04-28 15:26:35,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {3771#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {3771#true} is VALID [2022-04-28 15:26:35,704 INFO L272 TraceCheckUtils]: 7: Hoare triple {3771#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3771#true} is VALID [2022-04-28 15:26:35,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {3771#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !false; {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,729 INFO L290 TraceCheckUtils]: 33: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,732 INFO L290 TraceCheckUtils]: 41: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} is VALID [2022-04-28 15:26:35,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {3776#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8640))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {3777#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 15:26:35,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {3777#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {3772#false} is VALID [2022-04-28 15:26:35,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {3772#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3772#false} is VALID [2022-04-28 15:26:35,734 INFO L290 TraceCheckUtils]: 46: Hoare triple {3772#false} assume 4 == ~blastFlag~0; {3772#false} is VALID [2022-04-28 15:26:35,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 15:26:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:26:35,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:35,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120059357] [2022-04-28 15:26:35,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120059357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:35,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:35,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:35,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:35,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557305662] [2022-04-28 15:26:35,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557305662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:35,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:35,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148226792] [2022-04-28 15:26:35,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:35,737 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-28 15:26:35,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:35,737 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-28 15:26:35,775 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-28 15:26:35,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:35,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:35,776 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-28 15:26:38,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:41,048 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:43,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:45,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:46,232 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-28 15:26:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:46,233 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-28 15:26:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:46,233 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-28 15:26:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:26:46,237 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-28 15:26:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:26:46,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 15:26:46,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:46,631 INFO L225 Difference]: With dead ends: 503 [2022-04-28 15:26:46,632 INFO L226 Difference]: Without dead ends: 319 [2022-04-28 15:26:46,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:26:46,633 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 123 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:46,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 478 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 15:26:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-28 15:26:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-28 15:26:46,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:46,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:46,645 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:46,645 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:46,657 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 15:26:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 15:26:46,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:46,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:46,658 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-28 15:26:46,659 INFO L87 Difference]: Start difference. First operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 319 states. [2022-04-28 15:26:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:46,666 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 15:26:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 15:26:46,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:46,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:46,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:46,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 234 states have (on average 1.641025641025641) internal successors, (384), 234 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 15:26:46,686 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-28 15:26:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:46,686 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 15:26:46,686 INFO L496 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-28 15:26:46,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 15:26:46,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 15:26:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 15:26:46,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:46,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:46,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:26:46,966 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 1 times [2022-04-28 15:26:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:46,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1766760142] [2022-04-28 15:26:46,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:26:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1734094884, now seen corresponding path program 2 times [2022-04-28 15:26:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:46,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964839221] [2022-04-28 15:26:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:46,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:47,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-28 15:26:47,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 15:26:47,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5905#true} {5905#true} #689#return; {5905#true} is VALID [2022-04-28 15:26:47,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {5905#true} call ULTIMATE.init(); {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:26:47,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {5912#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5905#true} is VALID [2022-04-28 15:26:47,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 15:26:47,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5905#true} {5905#true} #689#return; {5905#true} is VALID [2022-04-28 15:26:47,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {5905#true} call #t~ret161 := main(); {5905#true} is VALID [2022-04-28 15:26:47,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {5905#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5905#true} is VALID [2022-04-28 15:26:47,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {5905#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {5905#true} is VALID [2022-04-28 15:26:47,075 INFO L272 TraceCheckUtils]: 7: Hoare triple {5905#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5905#true} is VALID [2022-04-28 15:26:47,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {5905#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:47,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {5910#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5911#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 15:26:47,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {5911#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {5906#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {5906#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {5906#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {5906#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {5906#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {5906#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {5906#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {5906#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {5906#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {5906#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {5906#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {5906#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {5906#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {5906#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {5906#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {5906#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {5906#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {5906#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {5906#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {5906#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume 8641 == #t~mem76;havoc #t~mem76; {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {5906#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {5906#false} assume 4 == ~blastFlag~0; {5906#false} is VALID [2022-04-28 15:26:47,085 INFO L290 TraceCheckUtils]: 48: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-04-28 15:26:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:26:47,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:47,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964839221] [2022-04-28 15:26:47,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964839221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:47,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:47,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:47,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:47,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1766760142] [2022-04-28 15:26:47,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1766760142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:47,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:47,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:47,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085355031] [2022-04-28 15:26:47,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 15:26:47,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:47,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:47,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:47,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:47,135 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-28 15:26:52,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:26:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:57,323 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-28 15:26:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:26:57,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 15:26:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:26:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:26:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:26:57,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-28 15:26:57,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:57,643 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:26:57,643 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:26:57,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:26:57,644 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:26:57,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 481 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 15:26:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:26:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:26:57,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:26:57,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,654 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,654 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:57,658 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:26:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:26:57,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:57,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:57,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:26:57,660 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:26:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:26:57,664 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:26:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:26:57,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:26:57,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:26:57,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:26:57,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:26:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6448979591836734) internal successors, (403), 245 states have internal predecessors, (403), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-28 15:26:57,669 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 49 [2022-04-28 15:26:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:26:57,669 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-28 15:26:57,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:26:57,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-28 15:26:57,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:26:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-28 15:26:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 15:26:57,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:26:57,941 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:26:57,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:26:57,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:26:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:26:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 1 times [2022-04-28 15:26:57,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:57,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255165557] [2022-04-28 15:26:57,969 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:26:57,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:26:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1174088998, now seen corresponding path program 2 times [2022-04-28 15:26:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:26:57,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274148052] [2022-04-28 15:26:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:26:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:26:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:58,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:26:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:26:58,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7933#true} is VALID [2022-04-28 15:26:58,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-28 15:26:58,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7933#true} {7933#true} #689#return; {7933#true} is VALID [2022-04-28 15:26:58,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {7933#true} call ULTIMATE.init(); {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:26:58,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {7940#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7933#true} is VALID [2022-04-28 15:26:58,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-28 15:26:58,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #689#return; {7933#true} is VALID [2022-04-28 15:26:58,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret161 := main(); {7933#true} is VALID [2022-04-28 15:26:58,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {7933#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7933#true} is VALID [2022-04-28 15:26:58,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {7933#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {7933#true} is VALID [2022-04-28 15:26:58,113 INFO L272 TraceCheckUtils]: 7: Hoare triple {7933#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7933#true} is VALID [2022-04-28 15:26:58,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {7933#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {7938#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7939#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {7939#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {7934#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {7934#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {7934#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {7934#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} ~skip~0 := 0; {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-28 15:26:58,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {7934#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {7934#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {7934#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {7934#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {7934#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {7934#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {7934#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {7934#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {7934#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {7934#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {7934#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {7934#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {7934#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {7934#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {7934#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {7934#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {7934#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {7934#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {7934#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {7934#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {7934#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {7934#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {7934#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {7934#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {7934#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,131 INFO L290 TraceCheckUtils]: 53: Hoare triple {7934#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {7934#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {7934#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,132 INFO L290 TraceCheckUtils]: 56: Hoare triple {7934#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {7934#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {7934#false} is VALID [2022-04-28 15:26:58,133 INFO L290 TraceCheckUtils]: 58: Hoare triple {7934#false} assume 8641 == #t~mem76;havoc #t~mem76; {7934#false} is VALID [2022-04-28 15:26:58,134 INFO L290 TraceCheckUtils]: 59: Hoare triple {7934#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7934#false} is VALID [2022-04-28 15:26:58,134 INFO L290 TraceCheckUtils]: 60: Hoare triple {7934#false} assume 4 == ~blastFlag~0; {7934#false} is VALID [2022-04-28 15:26:58,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-28 15:26:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:26:58,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:26:58,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274148052] [2022-04-28 15:26:58,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274148052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:58,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:58,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:58,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:26:58,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255165557] [2022-04-28 15:26:58,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255165557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:26:58,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:26:58,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:26:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579428917] [2022-04-28 15:26:58,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:26:58,135 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-28 15:26:58,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:26:58,136 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-28 15:26:58,183 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-28 15:26:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:26:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:26:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:26:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:26:58,184 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-28 15:27:00,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:01,116 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-28 15:27:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:01,117 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-28 15:27:01,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:01,117 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-28 15:27:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:27:01,119 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-28 15:27:01,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:27:01,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:27:01,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:01,434 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:27:01,434 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:27:01,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:01,435 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:01,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:27:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:27:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:27:01,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:01,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:01,446 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:01,446 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:01,450 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:27:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:27:01,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:01,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:01,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:27:01,452 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 267 states. [2022-04-28 15:27:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:01,456 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:27:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:27:01,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:01,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:01,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:01,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6408163265306122) internal successors, (402), 245 states have internal predecessors, (402), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-28 15:27:01,463 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 62 [2022-04-28 15:27:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:01,463 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-28 15:27:01,463 INFO L496 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-28 15:27:01,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-28 15:27:01,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-28 15:27:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:27:01,727 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:01,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:01,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:27:01,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:01,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:01,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 1 times [2022-04-28 15:27:01,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:01,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1149322743] [2022-04-28 15:27:01,752 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:27:01,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1299527402, now seen corresponding path program 2 times [2022-04-28 15:27:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560726273] [2022-04-28 15:27:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:01,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:01,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:01,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9961#true} is VALID [2022-04-28 15:27:01,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-28 15:27:01,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9961#true} {9961#true} #689#return; {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {9961#true} call ULTIMATE.init(); {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:27:01,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {9968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9961#true} {9961#true} #689#return; {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {9961#true} call #t~ret161 := main(); {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {9961#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {9961#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {9961#true} is VALID [2022-04-28 15:27:01,887 INFO L272 TraceCheckUtils]: 7: Hoare triple {9961#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9961#true} is VALID [2022-04-28 15:27:01,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {9961#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {9966#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {9967#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {9962#false} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {9962#false} call write~int(1, ~s.base, 60 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {9962#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {9962#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {9962#false} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {9962#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {9962#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {9962#false} is VALID [2022-04-28 15:27:01,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {9962#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {9962#false} is VALID [2022-04-28 15:27:01,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {9962#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {9962#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {9962#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {9962#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#false} ~skip~0 := 0; {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {9962#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {9962#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {9962#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {9962#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {9962#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {9962#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {9962#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {9962#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 37: Hoare triple {9962#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {9962#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {9962#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {9962#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {9962#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {9962#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {9962#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {9962#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {9962#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {9962#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {9962#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {9962#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {9962#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {9962#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {9962#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {9962#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {9962#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 54: Hoare triple {9962#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 55: Hoare triple {9962#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 56: Hoare triple {9962#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {9962#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {9962#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 59: Hoare triple {9962#false} assume 8641 == #t~mem76;havoc #t~mem76; {9962#false} is VALID [2022-04-28 15:27:01,896 INFO L290 TraceCheckUtils]: 60: Hoare triple {9962#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9962#false} is VALID [2022-04-28 15:27:01,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {9962#false} assume 4 == ~blastFlag~0; {9962#false} is VALID [2022-04-28 15:27:01,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-28 15:27:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:01,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560726273] [2022-04-28 15:27:01,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560726273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:01,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:01,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:01,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1149322743] [2022-04-28 15:27:01,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1149322743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:01,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:01,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088650212] [2022-04-28 15:27:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:01,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:01,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:01,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:01,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:01,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:01,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:01,943 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-28 15:27:05,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:07,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:09,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:10,907 INFO L93 Difference]: Finished difference Result 563 states and 907 transitions. [2022-04-28 15:27:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:10,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 15:27:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 15:27:10,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 15:27:11,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:11,341 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:27:11,341 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:27:11,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:11,342 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 151 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:11,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 15:27:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:27:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:27:11,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:11,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,351 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,351 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:11,389 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-28 15:27:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-28 15:27:11,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:11,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:11,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:27:11,390 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:27:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:11,396 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-28 15:27:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-28 15:27:11,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:11,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:11,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:11,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6244897959183673) internal successors, (398), 245 states have internal predecessors, (398), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-28 15:27:11,402 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 63 [2022-04-28 15:27:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:11,402 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-28 15:27:11,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-28 15:27:11,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-28 15:27:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:27:11,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:11,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:27:11,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:11,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:11,707 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 1 times [2022-04-28 15:27:11,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:11,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244308671] [2022-04-28 15:27:11,731 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:27:11,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash 252016598, now seen corresponding path program 2 times [2022-04-28 15:27:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:11,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161171566] [2022-04-28 15:27:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:11,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:11,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12277#true} is VALID [2022-04-28 15:27:11,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-28 15:27:11,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12277#true} {12277#true} #689#return; {12277#true} is VALID [2022-04-28 15:27:11,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {12277#true} call ULTIMATE.init(); {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:27:11,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {12284#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12277#true} is VALID [2022-04-28 15:27:11,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-28 15:27:11,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12277#true} {12277#true} #689#return; {12277#true} is VALID [2022-04-28 15:27:11,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {12277#true} call #t~ret161 := main(); {12277#true} is VALID [2022-04-28 15:27:11,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {12277#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12277#true} is VALID [2022-04-28 15:27:11,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {12277#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {12277#true} is VALID [2022-04-28 15:27:11,847 INFO L272 TraceCheckUtils]: 7: Hoare triple {12277#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12277#true} is VALID [2022-04-28 15:27:11,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {12277#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !false; {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} is VALID [2022-04-28 15:27:11,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {12282#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 16384))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12283#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {12283#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {12278#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {12278#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {12278#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {12278#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {12278#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {12278#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {12278#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {12278#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {12278#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {12278#false} ~skip~0 := 0; {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {12278#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {12278#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {12278#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {12278#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {12278#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {12278#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {12278#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {12278#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {12278#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {12278#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {12278#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {12278#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {12278#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {12278#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,860 INFO L290 TraceCheckUtils]: 43: Hoare triple {12278#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {12278#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {12278#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {12278#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {12278#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {12278#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {12278#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {12278#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {12278#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {12278#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {12278#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {12278#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 55: Hoare triple {12278#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 56: Hoare triple {12278#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {12278#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {12278#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {12278#false} assume 8641 == #t~mem76;havoc #t~mem76; {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {12278#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 61: Hoare triple {12278#false} assume 4 == ~blastFlag~0; {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L290 TraceCheckUtils]: 62: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-28 15:27:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161171566] [2022-04-28 15:27:11,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161171566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:11,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:11,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:11,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244308671] [2022-04-28 15:27:11,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244308671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:11,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:11,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:11,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658878220] [2022-04-28 15:27:11,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:11,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:11,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:11,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:11,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:11,923 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-28 15:27:15,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:17,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:19,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:21,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:22,345 INFO L93 Difference]: Finished difference Result 563 states and 900 transitions. [2022-04-28 15:27:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:22,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 15:27:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 15:27:22,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-28 15:27:22,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:22,766 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:27:22,766 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:27:22,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:22,767 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:22,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 473 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-28 15:27:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:27:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:27:22,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:22,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,778 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,779 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:22,786 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-28 15:27:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-28 15:27:22,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:22,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:22,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:27:22,787 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:27:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:22,793 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-28 15:27:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-28 15:27:22,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:22,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:22,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:22,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6081632653061224) internal successors, (394), 245 states have internal predecessors, (394), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-28 15:27:22,799 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 63 [2022-04-28 15:27:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:22,799 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-28 15:27:22,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:22,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-28 15:27:23,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-28 15:27:23,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:27:23,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:23,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:23,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:27:23,089 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1374583425, now seen corresponding path program 1 times [2022-04-28 15:27:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:23,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481324034] [2022-04-28 15:27:23,110 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:27:23,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1374583425, now seen corresponding path program 2 times [2022-04-28 15:27:23,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:23,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484611216] [2022-04-28 15:27:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:23,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14593#true} is VALID [2022-04-28 15:27:23,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-28 15:27:23,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14593#true} {14593#true} #689#return; {14593#true} is VALID [2022-04-28 15:27:23,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {14593#true} call ULTIMATE.init(); {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:27:23,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {14600#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14593#true} is VALID [2022-04-28 15:27:23,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-28 15:27:23,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14593#true} {14593#true} #689#return; {14593#true} is VALID [2022-04-28 15:27:23,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {14593#true} call #t~ret161 := main(); {14593#true} is VALID [2022-04-28 15:27:23,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {14593#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {14593#true} is VALID [2022-04-28 15:27:23,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {14593#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {14593#true} is VALID [2022-04-28 15:27:23,220 INFO L272 TraceCheckUtils]: 7: Hoare triple {14593#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14593#true} is VALID [2022-04-28 15:27:23,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {14593#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:23,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {14598#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14599#(= 8464 |ssl3_accept_#t~mem53|)} is VALID [2022-04-28 15:27:23,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {14599#(= 8464 |ssl3_accept_#t~mem53|)} assume 8481 == #t~mem53;havoc #t~mem53; {14594#false} is VALID [2022-04-28 15:27:23,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {14594#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {14594#false} is VALID [2022-04-28 15:27:23,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {14594#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {14594#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {14594#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {14594#false} is VALID [2022-04-28 15:27:23,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {14594#false} ~skip~0 := 0; {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {14594#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {14594#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {14594#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {14594#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {14594#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 34: Hoare triple {14594#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {14594#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {14594#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {14594#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {14594#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {14594#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {14594#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {14594#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {14594#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {14594#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {14594#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {14594#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 46: Hoare triple {14594#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {14594#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {14594#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {14594#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {14594#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {14594#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {14594#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {14594#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 54: Hoare triple {14594#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 55: Hoare triple {14594#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 56: Hoare triple {14594#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {14594#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {14594#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 59: Hoare triple {14594#false} assume 8641 == #t~mem76;havoc #t~mem76; {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {14594#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14594#false} is VALID [2022-04-28 15:27:23,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {14594#false} assume 4 == ~blastFlag~0; {14594#false} is VALID [2022-04-28 15:27:23,230 INFO L290 TraceCheckUtils]: 62: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-28 15:27:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:23,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:23,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484611216] [2022-04-28 15:27:23,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484611216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:23,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:23,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:23,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481324034] [2022-04-28 15:27:23,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481324034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:23,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:23,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:23,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874371104] [2022-04-28 15:27:23,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:23,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:23,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:23,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:23,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:23,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:23,272 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-28 15:27:25,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:26,164 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-28 15:27:26,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:26,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:27:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:27:26,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 15:27:26,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:26,474 INFO L225 Difference]: With dead ends: 488 [2022-04-28 15:27:26,474 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 15:27:26,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:26,475 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:26,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:27:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 15:27:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-28 15:27:26,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:26,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,482 INFO L74 IsIncluded]: Start isIncluded. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,483 INFO L87 Difference]: Start difference. First operand 264 states. Second operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:26,487 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:27:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:27:26,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:26,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:26,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 15:27:26,488 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 264 states. [2022-04-28 15:27:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:26,492 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:27:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:27:26,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:26,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:26,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:26,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6040816326530611) internal successors, (393), 245 states have internal predecessors, (393), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-28 15:27:26,497 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 63 [2022-04-28 15:27:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:26,497 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-28 15:27:26,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-28 15:27:26,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-28 15:27:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:27:26,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:26,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:26,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:27:26,761 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1233856738, now seen corresponding path program 1 times [2022-04-28 15:27:26,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:26,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1707289386] [2022-04-28 15:27:26,772 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:27:26,772 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1233856738, now seen corresponding path program 2 times [2022-04-28 15:27:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:26,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318617832] [2022-04-28 15:27:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:26,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16609#true} is VALID [2022-04-28 15:27:26,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-28 15:27:26,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16609#true} {16609#true} #689#return; {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {16609#true} call ULTIMATE.init(); {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:27:26,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {16616#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16609#true} {16609#true} #689#return; {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {16609#true} call #t~ret161 := main(); {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {16609#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {16609#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {16609#true} is VALID [2022-04-28 15:27:26,864 INFO L272 TraceCheckUtils]: 7: Hoare triple {16609#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16609#true} is VALID [2022-04-28 15:27:26,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {16609#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:27:26,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {16614#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16615#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-28 15:27:26,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {16615#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {16610#false} is VALID [2022-04-28 15:27:26,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {16610#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {16610#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {16610#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {16610#false} ~skip~0 := 0; {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {16610#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {16610#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {16610#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {16610#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {16610#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {16610#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {16610#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {16610#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {16610#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {16610#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {16610#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {16610#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {16610#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {16610#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {16610#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {16610#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {16610#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {16610#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {16610#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {16610#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {16610#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {16610#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {16610#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 52: Hoare triple {16610#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 53: Hoare triple {16610#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {16610#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {16610#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {16610#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 57: Hoare triple {16610#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {16610#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {16610#false} assume 8641 == #t~mem76;havoc #t~mem76; {16610#false} is VALID [2022-04-28 15:27:26,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {16610#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16610#false} is VALID [2022-04-28 15:27:26,874 INFO L290 TraceCheckUtils]: 61: Hoare triple {16610#false} assume 4 == ~blastFlag~0; {16610#false} is VALID [2022-04-28 15:27:26,874 INFO L290 TraceCheckUtils]: 62: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-28 15:27:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318617832] [2022-04-28 15:27:26,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318617832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:26,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:26,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:26,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1707289386] [2022-04-28 15:27:26,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1707289386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:26,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:26,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157494474] [2022-04-28 15:27:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:26,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:26,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:26,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:26,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:26,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:26,918 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-28 15:27:29,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:31,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:33,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:36,260 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-28 15:27:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:37,090 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-28 15:27:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:37,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 15:27:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:27:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:27:37,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-28 15:27:37,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:37,378 INFO L225 Difference]: With dead ends: 487 [2022-04-28 15:27:37,379 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 15:27:37,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:37,379 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:37,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 355 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 15:27:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 15:27:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-28 15:27:37,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:37,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,387 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,389 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:37,392 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:27:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:27:37,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:37,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:37,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-28 15:27:37,393 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 263 states. [2022-04-28 15:27:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:37,397 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:27:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:27:37,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:37,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:37,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:37,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.6) internal successors, (392), 245 states have internal predecessors, (392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-28 15:27:37,403 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 63 [2022-04-28 15:27:37,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:37,403 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-28 15:27:37,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-28 15:27:37,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-28 15:27:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:27:37,665 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:37,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:37,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:27:37,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash 697043729, now seen corresponding path program 1 times [2022-04-28 15:27:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:37,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758535779] [2022-04-28 15:27:37,682 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:27:37,682 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash 697043729, now seen corresponding path program 2 times [2022-04-28 15:27:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:37,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986000785] [2022-04-28 15:27:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:37,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:37,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18621#true} is VALID [2022-04-28 15:27:37,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-28 15:27:37,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18621#true} {18621#true} #689#return; {18621#true} is VALID [2022-04-28 15:27:37,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {18621#true} call ULTIMATE.init(); {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:27:37,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {18628#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18621#true} is VALID [2022-04-28 15:27:37,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-28 15:27:37,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18621#true} {18621#true} #689#return; {18621#true} is VALID [2022-04-28 15:27:37,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {18621#true} call #t~ret161 := main(); {18621#true} is VALID [2022-04-28 15:27:37,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {18621#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18621#true} is VALID [2022-04-28 15:27:37,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {18621#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {18621#true} is VALID [2022-04-28 15:27:37,782 INFO L272 TraceCheckUtils]: 7: Hoare triple {18621#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18621#true} is VALID [2022-04-28 15:27:37,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {18621#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:37,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {18626#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-28 15:27:37,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {18627#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18622#false} is VALID [2022-04-28 15:27:37,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {18622#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {18622#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {18622#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {18622#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {18622#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {18622#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {18622#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {18622#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {18622#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {18622#false} ~skip~0 := 0; {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {18622#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {18622#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {18622#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {18622#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {18622#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {18622#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {18622#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {18622#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {18622#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {18622#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {18622#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {18622#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {18622#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {18622#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {18622#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {18622#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {18622#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {18622#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {18622#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {18622#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {18622#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {18622#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {18622#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {18622#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {18622#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {18622#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {18622#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 57: Hoare triple {18622#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {18622#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {18622#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {18622#false} assume 8641 == #t~mem76;havoc #t~mem76; {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {18622#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {18622#false} assume 4 == ~blastFlag~0; {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-28 15:27:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:37,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:37,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986000785] [2022-04-28 15:27:37,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986000785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:37,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:37,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:37,791 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:37,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758535779] [2022-04-28 15:27:37,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758535779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:37,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:37,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360648632] [2022-04-28 15:27:37,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:37,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:27:37,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:37,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:37,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:37,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:37,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:37,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:37,837 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-28 15:27:41,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:46,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:48,446 INFO L93 Difference]: Finished difference Result 563 states and 891 transitions. [2022-04-28 15:27:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 15:27:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:48,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:27:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:27:48,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:27:48,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:48,877 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:27:48,877 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:27:48,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:27:48,879 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:27:48,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 15:27:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:27:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:27:48,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:27:48,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,888 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,889 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:48,894 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-28 15:27:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-28 15:27:48,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:48,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:48,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:27:48,895 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:27:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:48,900 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-28 15:27:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-28 15:27:48,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:27:48,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:27:48,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:27:48,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:27:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.583673469387755) internal successors, (388), 245 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-28 15:27:48,905 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 64 [2022-04-28 15:27:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:27:48,905 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-28 15:27:48,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:48,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-28 15:27:49,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-28 15:27:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:27:49,186 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:27:49,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:27:49,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:27:49,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:27:49,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:27:49,192 INFO L85 PathProgramCache]: Analyzing trace with hash -13786287, now seen corresponding path program 1 times [2022-04-28 15:27:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:49,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [794708869] [2022-04-28 15:27:49,212 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:27:49,212 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:27:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash -13786287, now seen corresponding path program 2 times [2022-04-28 15:27:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:27:49,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120996208] [2022-04-28 15:27:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:27:49,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:27:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:27:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:27:49,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20937#true} is VALID [2022-04-28 15:27:49,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-28 15:27:49,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20937#true} {20937#true} #689#return; {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {20937#true} call ULTIMATE.init(); {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:27:49,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {20944#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20937#true} {20937#true} #689#return; {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {20937#true} call #t~ret161 := main(); {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {20937#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {20937#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {20937#true} is VALID [2022-04-28 15:27:49,328 INFO L272 TraceCheckUtils]: 7: Hoare triple {20937#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20937#true} is VALID [2022-04-28 15:27:49,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {20937#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {20942#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {20943#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20938#false} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {20938#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {20938#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {20938#false} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {20938#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {20938#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {20938#false} is VALID [2022-04-28 15:27:49,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {20938#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {20938#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {20938#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {20938#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {20938#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {20938#false} ~skip~0 := 0; {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {20938#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {20938#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {20938#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {20938#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {20938#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {20938#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {20938#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {20938#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 39: Hoare triple {20938#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {20938#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {20938#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {20938#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {20938#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {20938#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {20938#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {20938#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {20938#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {20938#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {20938#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {20938#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {20938#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {20938#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {20938#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {20938#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {20938#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {20938#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {20938#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {20938#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {20938#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {20938#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {20938#false} is VALID [2022-04-28 15:27:49,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {20938#false} assume 8641 == #t~mem76;havoc #t~mem76; {20938#false} is VALID [2022-04-28 15:27:49,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {20938#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {20938#false} is VALID [2022-04-28 15:27:49,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {20938#false} assume 4 == ~blastFlag~0; {20938#false} is VALID [2022-04-28 15:27:49,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-28 15:27:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:27:49,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:27:49,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120996208] [2022-04-28 15:27:49,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120996208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:49,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:49,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:49,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:27:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [794708869] [2022-04-28 15:27:49,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [794708869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:27:49,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:27:49,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:27:49,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372484837] [2022-04-28 15:27:49,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:27:49,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:27:49,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:27:49,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:49,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:27:49,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:27:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:27:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:27:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:27:49,384 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-28 15:27:51,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:55,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:57,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:27:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:27:59,988 INFO L93 Difference]: Finished difference Result 563 states and 884 transitions. [2022-04-28 15:27:59,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:27:59,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 15:27:59,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:27:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 15:27:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:27:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 15:27:59,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-28 15:28:00,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 592 edges. 592 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:00,373 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:00,373 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:00,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:00,374 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:00,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 15:28:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:28:00,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:00,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:00,383 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:00,383 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:00,388 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-28 15:28:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-28 15:28:00,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:00,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:00,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:00,390 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:00,395 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-28 15:28:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-28 15:28:00,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:00,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:00,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:00,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.5673469387755101) internal successors, (384), 245 states have internal predecessors, (384), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-28 15:28:00,399 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 65 [2022-04-28 15:28:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:00,399 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-28 15:28:00,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:00,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-28 15:28:00,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-28 15:28:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:28:00,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:00,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:28:00,674 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:00,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:00,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2098517804, now seen corresponding path program 1 times [2022-04-28 15:28:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:00,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997414133] [2022-04-28 15:28:00,697 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:28:00,698 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2098517804, now seen corresponding path program 2 times [2022-04-28 15:28:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:00,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586501262] [2022-04-28 15:28:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:00,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23253#true} is VALID [2022-04-28 15:28:00,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-28 15:28:00,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23253#true} {23253#true} #689#return; {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {23253#true} call ULTIMATE.init(); {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:28:00,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {23260#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23253#true} {23253#true} #689#return; {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {23253#true} call #t~ret161 := main(); {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {23253#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {23253#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {23253#true} is VALID [2022-04-28 15:28:00,804 INFO L272 TraceCheckUtils]: 7: Hoare triple {23253#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23253#true} is VALID [2022-04-28 15:28:00,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {23253#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:00,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {23258#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23259#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-28 15:28:00,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {23259#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {23254#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {23254#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {23254#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {23254#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {23254#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {23254#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {23254#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {23254#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {23254#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {23254#false} ~skip~0 := 0; {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {23254#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {23254#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {23254#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {23254#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {23254#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {23254#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {23254#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {23254#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {23254#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {23254#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {23254#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {23254#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {23254#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {23254#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 46: Hoare triple {23254#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {23254#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {23254#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {23254#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 50: Hoare triple {23254#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 51: Hoare triple {23254#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {23254#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 53: Hoare triple {23254#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {23254#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {23254#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {23254#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {23254#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {23254#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {23254#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {23254#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {23254#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {23254#false} is VALID [2022-04-28 15:28:00,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#false} assume 8641 == #t~mem76;havoc #t~mem76; {23254#false} is VALID [2022-04-28 15:28:00,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {23254#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {23254#false} is VALID [2022-04-28 15:28:00,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {23254#false} assume 4 == ~blastFlag~0; {23254#false} is VALID [2022-04-28 15:28:00,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-28 15:28:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586501262] [2022-04-28 15:28:00,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586501262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:00,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:00,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:00,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:00,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997414133] [2022-04-28 15:28:00,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997414133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:00,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:00,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202860643] [2022-04-28 15:28:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:28:00,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:00,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:00,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:00,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:00,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:00,873 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-28 15:28:04,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:10,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:13,730 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-28 15:28:13,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:13,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:28:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:28:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:28:13,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 15:28:13,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:13,990 INFO L225 Difference]: With dead ends: 477 [2022-04-28 15:28:13,990 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 15:28:13,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:13,991 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:13,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 15:28:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 15:28:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-28 15:28:13,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:13,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,999 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:13,999 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:14,002 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:28:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:28:14,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:14,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:14,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 15:28:14,004 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 253 states. [2022-04-28 15:28:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:14,008 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:28:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:28:14,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:14,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:14,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:14,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-28 15:28:14,013 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 66 [2022-04-28 15:28:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:14,013 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-28 15:28:14,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:14,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-28 15:28:14,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-28 15:28:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:28:14,282 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:14,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:14,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:28:14,282 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1399377437, now seen corresponding path program 1 times [2022-04-28 15:28:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:14,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077391494] [2022-04-28 15:28:14,298 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:14,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1399377437, now seen corresponding path program 2 times [2022-04-28 15:28:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637109677] [2022-04-28 15:28:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:14,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:14,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25225#true} is VALID [2022-04-28 15:28:14,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-28 15:28:14,462 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25225#true} {25225#true} #689#return; {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {25225#true} call ULTIMATE.init(); {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:28:14,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {25232#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25225#true} {25225#true} #689#return; {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {25225#true} call #t~ret161 := main(); {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {25225#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {25225#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L272 TraceCheckUtils]: 7: Hoare triple {25225#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {25225#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {25225#true} is VALID [2022-04-28 15:28:14,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {25225#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {25225#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {25225#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {25225#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {25225#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#true} assume !false; {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {25225#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {25225#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {25225#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {25225#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {25225#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {25225#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {25225#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {25225#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {25225#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25225#true} is VALID [2022-04-28 15:28:14,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {25225#true} assume 8464 == #t~mem55;havoc #t~mem55; {25225#true} is VALID [2022-04-28 15:28:14,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {25225#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {25225#true} is VALID [2022-04-28 15:28:14,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {25225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25225#true} is VALID [2022-04-28 15:28:14,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {25225#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} ~skip~0 := 0; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !false; {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,477 INFO L290 TraceCheckUtils]: 58: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,477 INFO L290 TraceCheckUtils]: 59: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,478 INFO L290 TraceCheckUtils]: 60: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} is VALID [2022-04-28 15:28:14,478 INFO L290 TraceCheckUtils]: 61: Hoare triple {25230#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8641))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {25231#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 15:28:14,478 INFO L290 TraceCheckUtils]: 62: Hoare triple {25231#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {25226#false} is VALID [2022-04-28 15:28:14,479 INFO L290 TraceCheckUtils]: 63: Hoare triple {25226#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {25226#false} is VALID [2022-04-28 15:28:14,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {25226#false} assume 4 == ~blastFlag~0; {25226#false} is VALID [2022-04-28 15:28:14,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {25226#false} assume !false; {25226#false} is VALID [2022-04-28 15:28:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:14,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:14,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637109677] [2022-04-28 15:28:14,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637109677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:14,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:14,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:14,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:14,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077391494] [2022-04-28 15:28:14,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077391494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:14,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:14,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143036615] [2022-04-28 15:28:14,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:28:14,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:14,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:14,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:14,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:14,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:14,529 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-28 15:28:16,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:20,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:22,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:24,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:25,600 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2022-04-28 15:28:25,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 15:28:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:28:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:28:25,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 15:28:25,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:25,984 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:28:25,984 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:28:25,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:25,985 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 119 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 480 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:25,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 358 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 480 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 15:28:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:28:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-28 15:28:25,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:25,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,993 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,994 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:25,999 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-28 15:28:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-28 15:28:25,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:25,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:26,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:26,000 INFO L87 Difference]: Start difference. First operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 339 states. [2022-04-28 15:28:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:26,005 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-28 15:28:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-28 15:28:26,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:26,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:26,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:26,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.578125) internal successors, (404), 256 states have internal predecessors, (404), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:26,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-28 15:28:26,010 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 66 [2022-04-28 15:28:26,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:26,010 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-28 15:28:26,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:26,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-28 15:28:26,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-28 15:28:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:28:26,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:26,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:28:26,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 1 times [2022-04-28 15:28:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:26,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158474661] [2022-04-28 15:28:26,412 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:26,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2127873441, now seen corresponding path program 2 times [2022-04-28 15:28:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:26,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105116369] [2022-04-28 15:28:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:26,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27563#true} is VALID [2022-04-28 15:28:26,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-28 15:28:26,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27563#true} {27563#true} #689#return; {27563#true} is VALID [2022-04-28 15:28:26,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {27563#true} call ULTIMATE.init(); {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:28:26,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {27570#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {27563#true} is VALID [2022-04-28 15:28:26,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-28 15:28:26,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27563#true} {27563#true} #689#return; {27563#true} is VALID [2022-04-28 15:28:26,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {27563#true} call #t~ret161 := main(); {27563#true} is VALID [2022-04-28 15:28:26,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {27563#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {27563#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L272 TraceCheckUtils]: 7: Hoare triple {27563#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {27563#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {27563#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {27563#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {27563#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {27563#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {27563#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {27563#true} assume !false; {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {27563#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {27563#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {27563#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {27563#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {27563#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {27563#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {27563#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {27563#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {27563#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {27563#true} assume 8464 == #t~mem55;havoc #t~mem55; {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {27563#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {27563#true} is VALID [2022-04-28 15:28:26,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {27563#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27563#true} is VALID [2022-04-28 15:28:26,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {27563#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:28:26,546 INFO L290 TraceCheckUtils]: 47: Hoare triple {27568#(not (= 8528 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27569#(not (= |ssl3_accept_#t~mem62| 8528))} is VALID [2022-04-28 15:28:26,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {27569#(not (= |ssl3_accept_#t~mem62| 8528))} assume 8528 == #t~mem62;havoc #t~mem62; {27564#false} is VALID [2022-04-28 15:28:26,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {27564#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {27564#false} is VALID [2022-04-28 15:28:26,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {27564#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {27564#false} is VALID [2022-04-28 15:28:26,546 INFO L290 TraceCheckUtils]: 51: Hoare triple {27564#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {27564#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {27564#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {27564#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 55: Hoare triple {27564#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 56: Hoare triple {27564#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 57: Hoare triple {27564#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 58: Hoare triple {27564#false} ~skip~0 := 0; {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 59: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 60: Hoare triple {27564#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 61: Hoare triple {27564#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 62: Hoare triple {27564#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 63: Hoare triple {27564#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 64: Hoare triple {27564#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 65: Hoare triple {27564#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {27564#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {27564#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {27564#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {27564#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {27564#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 71: Hoare triple {27564#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {27564#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {27564#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {27564#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {27564#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 76: Hoare triple {27564#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 77: Hoare triple {27564#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {27564#false} assume 8544 == #t~mem64;havoc #t~mem64; {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 79: Hoare triple {27564#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 80: Hoare triple {27564#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 81: Hoare triple {27564#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 82: Hoare triple {27564#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 83: Hoare triple {27564#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 84: Hoare triple {27564#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {27564#false} is VALID [2022-04-28 15:28:26,548 INFO L290 TraceCheckUtils]: 85: Hoare triple {27564#false} assume 8 == ~blastFlag~0; {27564#false} is VALID [2022-04-28 15:28:26,549 INFO L290 TraceCheckUtils]: 86: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-28 15:28:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:26,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105116369] [2022-04-28 15:28:26,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105116369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:26,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:26,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:26,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:26,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158474661] [2022-04-28 15:28:26,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158474661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:26,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:26,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239315055] [2022-04-28 15:28:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:28:26,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:26,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:26,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:26,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:26,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:26,608 INFO L87 Difference]: Start difference. First operand 261 states and 408 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:34,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:37,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:39,150 INFO L93 Difference]: Finished difference Result 614 states and 963 transitions. [2022-04-28 15:28:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:39,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 15:28:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:28:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:28:39,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:28:39,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:39,625 INFO L225 Difference]: With dead ends: 614 [2022-04-28 15:28:39,625 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 15:28:39,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:39,626 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 132 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:39,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 358 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:28:39,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 15:28:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 287. [2022-04-28 15:28:39,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:39,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,642 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,643 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:39,648 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-28 15:28:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-28 15:28:39,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:39,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:39,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 15:28:39,649 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 379 states. [2022-04-28 15:28:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:39,655 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-28 15:28:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-28 15:28:39,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:39,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:39,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:39,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.574468085106383) internal successors, (444), 282 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-28 15:28:39,661 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-28 15:28:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:39,661 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-28 15:28:39,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:39,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-28 15:28:40,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-28 15:28:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:28:40,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:40,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:40,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:28:40,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:40,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:40,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1331515394, now seen corresponding path program 1 times [2022-04-28 15:28:40,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188851217] [2022-04-28 15:28:40,092 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:40,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1331515394, now seen corresponding path program 2 times [2022-04-28 15:28:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:40,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347414867] [2022-04-28 15:28:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:40,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30135#true} is VALID [2022-04-28 15:28:40,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-28 15:28:40,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30135#true} {30135#true} #689#return; {30135#true} is VALID [2022-04-28 15:28:40,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {30135#true} call ULTIMATE.init(); {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {30142#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30135#true} {30135#true} #689#return; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {30135#true} call #t~ret161 := main(); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {30135#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 6: Hoare triple {30135#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L272 TraceCheckUtils]: 7: Hoare triple {30135#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {30135#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {30135#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {30135#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {30135#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {30135#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {30135#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {30135#true} assume !false; {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {30135#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {30135#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {30135#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {30135#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {30135#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {30135#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {30135#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {30135#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {30135#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {30135#true} assume 8464 == #t~mem55;havoc #t~mem55; {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {30135#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {30135#true} is VALID [2022-04-28 15:28:40,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {30135#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30135#true} is VALID [2022-04-28 15:28:40,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {30135#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} ~skip~0 := 0; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !false; {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,214 INFO L290 TraceCheckUtils]: 43: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,214 INFO L290 TraceCheckUtils]: 45: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} is VALID [2022-04-28 15:28:40,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {30140#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8529))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30141#(not (= |ssl3_accept_#t~mem63| 8529))} is VALID [2022-04-28 15:28:40,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {30141#(not (= |ssl3_accept_#t~mem63| 8529))} assume 8529 == #t~mem63;havoc #t~mem63; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {30136#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {30136#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {30136#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {30136#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {30136#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {30136#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {30136#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {30136#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {30136#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {30136#false} ~skip~0 := 0; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {30136#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {30136#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {30136#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {30136#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {30136#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {30136#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {30136#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {30136#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {30136#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {30136#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {30136#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {30136#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {30136#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {30136#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {30136#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {30136#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {30136#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {30136#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#false} assume 8544 == #t~mem64;havoc #t~mem64; {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 80: Hoare triple {30136#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 81: Hoare triple {30136#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 82: Hoare triple {30136#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 83: Hoare triple {30136#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {30136#false} is VALID [2022-04-28 15:28:40,217 INFO L290 TraceCheckUtils]: 84: Hoare triple {30136#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {30136#false} is VALID [2022-04-28 15:28:40,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {30136#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {30136#false} is VALID [2022-04-28 15:28:40,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {30136#false} assume 8 == ~blastFlag~0; {30136#false} is VALID [2022-04-28 15:28:40,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-28 15:28:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 15:28:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:40,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347414867] [2022-04-28 15:28:40,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347414867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:40,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:40,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:40,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:40,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188851217] [2022-04-28 15:28:40,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188851217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:40,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:40,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142729731] [2022-04-28 15:28:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:28:40,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:40,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:40,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:40,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:40,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:40,272 INFO L87 Difference]: Start difference. First operand 287 states and 448 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:44,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:48,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:28:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:51,886 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2022-04-28 15:28:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:28:51,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:28:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:28:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:28:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:28:51,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:28:52,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:52,262 INFO L225 Difference]: With dead ends: 626 [2022-04-28 15:28:52,262 INFO L226 Difference]: Without dead ends: 365 [2022-04-28 15:28:52,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:28:52,262 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 131 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:28:52,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 499 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 15:28:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-28 15:28:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2022-04-28 15:28:52,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:28:52,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,275 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,275 INFO L87 Difference]: Start difference. First operand 365 states. Second operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:52,281 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-28 15:28:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-28 15:28:52,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:52,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:52,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-28 15:28:52,282 INFO L87 Difference]: Start difference. First operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 365 states. [2022-04-28 15:28:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:28:52,287 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-28 15:28:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-28 15:28:52,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:28:52,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:28:52,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:28:52,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:28:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 282 states have (on average 1.5638297872340425) internal successors, (441), 282 states have internal predecessors, (441), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-28 15:28:52,293 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-28 15:28:52,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:28:52,293 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-28 15:28:52,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-28 15:28:52,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-28 15:28:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:28:52,625 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:28:52,625 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:28:52,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:28:52,626 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:28:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:28:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1317444374, now seen corresponding path program 1 times [2022-04-28 15:28:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:52,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953632386] [2022-04-28 15:28:52,667 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:28:52,667 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:28:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1317444374, now seen corresponding path program 2 times [2022-04-28 15:28:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:28:52,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046990402] [2022-04-28 15:28:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:28:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:28:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:52,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:28:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:28:52,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32703#true} is VALID [2022-04-28 15:28:52,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-28 15:28:52,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32703#true} {32703#true} #689#return; {32703#true} is VALID [2022-04-28 15:28:52,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {32703#true} call ULTIMATE.init(); {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:28:52,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {32710#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32703#true} {32703#true} #689#return; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {32703#true} call #t~ret161 := main(); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {32703#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {32703#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L272 TraceCheckUtils]: 7: Hoare triple {32703#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {32703#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {32703#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {32703#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {32703#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {32703#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {32703#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {32703#true} assume !false; {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {32703#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {32703#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {32703#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {32703#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {32703#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {32703#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {32703#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {32703#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {32703#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 24: Hoare triple {32703#true} assume 8464 == #t~mem55;havoc #t~mem55; {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {32703#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {32703#true} is VALID [2022-04-28 15:28:52,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {32703#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32703#true} is VALID [2022-04-28 15:28:52,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {32703#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,784 INFO L290 TraceCheckUtils]: 41: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32709#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 44: Hoare triple {32709#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 47: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {32704#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 51: Hoare triple {32704#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 52: Hoare triple {32704#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {32704#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,785 INFO L290 TraceCheckUtils]: 54: Hoare triple {32704#false} assume 8448 == #t~mem68;havoc #t~mem68; {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {32704#false} assume !(~num1~0 > 0); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {32704#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {32704#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {32704#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 59: Hoare triple {32704#false} ~skip~0 := 0; {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 60: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {32704#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {32704#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 63: Hoare triple {32704#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 64: Hoare triple {32704#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 65: Hoare triple {32704#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 66: Hoare triple {32704#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {32704#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {32704#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {32704#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {32704#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 71: Hoare triple {32704#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 72: Hoare triple {32704#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 73: Hoare triple {32704#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {32704#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {32704#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {32704#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {32704#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {32704#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {32704#false} assume 8544 == #t~mem64;havoc #t~mem64; {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {32704#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {32704#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {32704#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {32704#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {32704#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {32704#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 86: Hoare triple {32704#false} assume 8 == ~blastFlag~0; {32704#false} is VALID [2022-04-28 15:28:52,787 INFO L290 TraceCheckUtils]: 87: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-28 15:28:52,788 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 15:28:52,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:28:52,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046990402] [2022-04-28 15:28:52,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046990402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:52,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:52,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:52,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:28:52,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953632386] [2022-04-28 15:28:52,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953632386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:28:52,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:28:52,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:28:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834760614] [2022-04-28 15:28:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:28:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:28:52,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:28:52,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:52,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:28:52,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:28:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:28:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:28:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:28:52,852 INFO L87 Difference]: Start difference. First operand 287 states and 445 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:28:59,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:02,136 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-28 15:29:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:02,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-04-28 15:29:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:29:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:29:02,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:29:02,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:02,435 INFO L225 Difference]: With dead ends: 590 [2022-04-28 15:29:02,435 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:29:02,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:02,436 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:02,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 15:29:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:29:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:29:02,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:02,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,449 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,449 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:02,456 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:29:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:29:02,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:02,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:02,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:02,458 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:02,463 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:29:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:29:02,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:02,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:02,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:02,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5625) internal successors, (475), 304 states have internal predecessors, (475), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-28 15:29:02,468 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-28 15:29:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:02,468 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-28 15:29:02,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:02,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-28 15:29:02,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-28 15:29:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 15:29:02,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:02,847 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:02,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:29:02,847 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1746030722, now seen corresponding path program 1 times [2022-04-28 15:29:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:02,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1837617215] [2022-04-28 15:29:02,945 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:02,945 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1746030722, now seen corresponding path program 2 times [2022-04-28 15:29:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:02,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615716843] [2022-04-28 15:29:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:03,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:03,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35171#true} is VALID [2022-04-28 15:29:03,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-28 15:29:03,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35171#true} {35171#true} #689#return; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {35171#true} call ULTIMATE.init(); {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {35178#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35171#true} {35171#true} #689#return; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {35171#true} call #t~ret161 := main(); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {35171#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {35171#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L272 TraceCheckUtils]: 7: Hoare triple {35171#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {35171#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {35171#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {35171#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {35171#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {35171#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {35171#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {35171#true} is VALID [2022-04-28 15:29:03,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {35171#true} assume !false; {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {35171#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {35171#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {35171#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {35171#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {35171#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {35171#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {35171#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {35171#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {35171#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {35171#true} assume 8464 == #t~mem55;havoc #t~mem55; {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {35171#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {35171#true} is VALID [2022-04-28 15:29:03,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {35171#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35171#true} is VALID [2022-04-28 15:29:03,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {35171#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:03,054 INFO L290 TraceCheckUtils]: 37: Hoare triple {35176#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35177#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-28 15:29:03,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {35177#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {35172#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {35172#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,055 INFO L290 TraceCheckUtils]: 56: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 63: Hoare triple {35172#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 64: Hoare triple {35172#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 65: Hoare triple {35172#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 66: Hoare triple {35172#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 67: Hoare triple {35172#false} assume 8448 == #t~mem68;havoc #t~mem68; {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 68: Hoare triple {35172#false} assume !(~num1~0 > 0); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 69: Hoare triple {35172#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 70: Hoare triple {35172#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 71: Hoare triple {35172#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 72: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 73: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:29:03,056 INFO L290 TraceCheckUtils]: 74: Hoare triple {35172#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 75: Hoare triple {35172#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 76: Hoare triple {35172#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 77: Hoare triple {35172#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 78: Hoare triple {35172#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 79: Hoare triple {35172#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 80: Hoare triple {35172#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 81: Hoare triple {35172#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 82: Hoare triple {35172#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 83: Hoare triple {35172#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 84: Hoare triple {35172#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 85: Hoare triple {35172#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 86: Hoare triple {35172#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 87: Hoare triple {35172#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 88: Hoare triple {35172#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 89: Hoare triple {35172#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 90: Hoare triple {35172#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 91: Hoare triple {35172#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,057 INFO L290 TraceCheckUtils]: 92: Hoare triple {35172#false} assume 8544 == #t~mem64;havoc #t~mem64; {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 93: Hoare triple {35172#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 94: Hoare triple {35172#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 95: Hoare triple {35172#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 96: Hoare triple {35172#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 97: Hoare triple {35172#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 98: Hoare triple {35172#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 99: Hoare triple {35172#false} assume 8 == ~blastFlag~0; {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L290 TraceCheckUtils]: 100: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:29:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615716843] [2022-04-28 15:29:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615716843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:03,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:03,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:03,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:03,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1837617215] [2022-04-28 15:29:03,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1837617215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:03,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:03,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473961601] [2022-04-28 15:29:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 15:29:03,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:03,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:03,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:03,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:03,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:03,126 INFO L87 Difference]: Start difference. First operand 309 states and 479 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:05,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:07,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:10,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:12,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:13,958 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-28 15:29:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-28 15:29:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:29:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:29:13,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 15:29:14,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:14,254 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:29:14,255 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:29:14,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:14,255 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:14,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 505 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 393 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-04-28 15:29:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:29:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:29:14,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:14,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:14,270 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:14,270 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:14,275 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:29:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:29:14,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:14,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:14,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:14,276 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 329 states. [2022-04-28 15:29:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:14,284 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:29:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:29:14,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:14,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:14,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:14,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5592105263157894) internal successors, (474), 304 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-28 15:29:14,290 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-28 15:29:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:14,290 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-28 15:29:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:14,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-28 15:29:14,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-28 15:29:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:29:14,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:14,681 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:14,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:29:14,681 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash 472000965, now seen corresponding path program 1 times [2022-04-28 15:29:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:14,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2021963991] [2022-04-28 15:29:14,733 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:14,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:14,733 INFO L85 PathProgramCache]: Analyzing trace with hash 472000965, now seen corresponding path program 2 times [2022-04-28 15:29:14,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:14,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447790226] [2022-04-28 15:29:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:14,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37683#true} is VALID [2022-04-28 15:29:14,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-28 15:29:14,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37683#true} {37683#true} #689#return; {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {37683#true} call ULTIMATE.init(); {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:14,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {37690#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37683#true} {37683#true} #689#return; {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {37683#true} call #t~ret161 := main(); {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {37683#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {37683#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {37683#true} is VALID [2022-04-28 15:29:14,846 INFO L272 TraceCheckUtils]: 7: Hoare triple {37683#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {37683#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {37683#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {37683#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {37683#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {37683#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {37683#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {37683#true} assume !false; {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {37683#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 16: Hoare triple {37683#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {37683#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {37683#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {37683#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {37683#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {37683#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {37683#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {37683#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37683#true} is VALID [2022-04-28 15:29:14,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {37683#true} assume 8464 == #t~mem55;havoc #t~mem55; {37683#true} is VALID [2022-04-28 15:29:14,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {37683#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {37683#true} is VALID [2022-04-28 15:29:14,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {37683#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37683#true} is VALID [2022-04-28 15:29:14,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {37683#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} ~skip~0 := 0; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !false; {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {37688#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37689#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {37689#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {37684#false} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {37684#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {37684#false} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {37684#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 43: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-28 15:29:14,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 47: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 48: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 51: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 56: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 60: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 63: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 64: Hoare triple {37684#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 65: Hoare triple {37684#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 66: Hoare triple {37684#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 67: Hoare triple {37684#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 68: Hoare triple {37684#false} assume 8448 == #t~mem68;havoc #t~mem68; {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 69: Hoare triple {37684#false} assume !(~num1~0 > 0); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 70: Hoare triple {37684#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 71: Hoare triple {37684#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {37684#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {37684#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {37684#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {37684#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {37684#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 79: Hoare triple {37684#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,854 INFO L290 TraceCheckUtils]: 80: Hoare triple {37684#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 81: Hoare triple {37684#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 82: Hoare triple {37684#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 83: Hoare triple {37684#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 84: Hoare triple {37684#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 85: Hoare triple {37684#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 86: Hoare triple {37684#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 87: Hoare triple {37684#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 88: Hoare triple {37684#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 89: Hoare triple {37684#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 90: Hoare triple {37684#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 91: Hoare triple {37684#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 92: Hoare triple {37684#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {37684#false} assume 8544 == #t~mem64;havoc #t~mem64; {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 94: Hoare triple {37684#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 95: Hoare triple {37684#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 96: Hoare triple {37684#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {37684#false} is VALID [2022-04-28 15:29:14,855 INFO L290 TraceCheckUtils]: 97: Hoare triple {37684#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {37684#false} is VALID [2022-04-28 15:29:14,856 INFO L290 TraceCheckUtils]: 98: Hoare triple {37684#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {37684#false} is VALID [2022-04-28 15:29:14,856 INFO L290 TraceCheckUtils]: 99: Hoare triple {37684#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {37684#false} is VALID [2022-04-28 15:29:14,856 INFO L290 TraceCheckUtils]: 100: Hoare triple {37684#false} assume 8 == ~blastFlag~0; {37684#false} is VALID [2022-04-28 15:29:14,856 INFO L290 TraceCheckUtils]: 101: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:29:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:14,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447790226] [2022-04-28 15:29:14,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447790226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:14,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:14,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:14,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:14,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2021963991] [2022-04-28 15:29:14,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2021963991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:14,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:14,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023622787] [2022-04-28 15:29:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:14,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 15:29:14,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:14,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:14,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:14,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:14,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:14,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:14,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:14,910 INFO L87 Difference]: Start difference. First operand 309 states and 478 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:19,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:21,102 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:23,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:24,479 INFO L93 Difference]: Finished difference Result 670 states and 1036 transitions. [2022-04-28 15:29:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 15:29:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:29:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:29:24,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 15:29:24,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:24,922 INFO L225 Difference]: With dead ends: 670 [2022-04-28 15:29:24,923 INFO L226 Difference]: Without dead ends: 387 [2022-04-28 15:29:24,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:24,924 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 140 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 57 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 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, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:24,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 497 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 15:29:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-28 15:29:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2022-04-28 15:29:24,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:24,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,941 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,942 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:24,951 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-28 15:29:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-28 15:29:24,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:24,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:24,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-28 15:29:24,953 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 387 states. [2022-04-28 15:29:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:24,962 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-28 15:29:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-28 15:29:24,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:24,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:24,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:24,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-28 15:29:24,971 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-28 15:29:24,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:24,971 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-28 15:29:24,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:24,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-28 15:29:25,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-28 15:29:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:29:25,367 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:25,367 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:25,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:29:25,367 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:25,367 INFO L85 PathProgramCache]: Analyzing trace with hash 781249060, now seen corresponding path program 1 times [2022-04-28 15:29:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:25,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13473314] [2022-04-28 15:29:25,417 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:25,417 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 781249060, now seen corresponding path program 2 times [2022-04-28 15:29:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:25,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676119578] [2022-04-28 15:29:25,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:25,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:25,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:25,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40427#true} is VALID [2022-04-28 15:29:25,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-28 15:29:25,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40427#true} {40427#true} #689#return; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {40427#true} call ULTIMATE.init(); {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {40434#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40427#true} {40427#true} #689#return; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {40427#true} call #t~ret161 := main(); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {40427#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {40427#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L272 TraceCheckUtils]: 7: Hoare triple {40427#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {40427#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {40427#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {40427#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {40427#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {40427#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {40427#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 14: Hoare triple {40427#true} assume !false; {40427#true} is VALID [2022-04-28 15:29:25,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {40427#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {40427#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {40427#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {40427#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {40427#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 20: Hoare triple {40427#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {40427#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 22: Hoare triple {40427#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {40427#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {40427#true} assume 8464 == #t~mem55;havoc #t~mem55; {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {40427#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40427#true} is VALID [2022-04-28 15:29:25,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {40427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40427#true} is VALID [2022-04-28 15:29:25,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {40427#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {40432#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40433#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {40433#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {40428#false} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {40428#false} call write~int(3, ~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-28 15:29:25,521 INFO L290 TraceCheckUtils]: 45: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 46: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 47: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 48: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 49: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 50: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 51: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 53: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 54: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 64: Hoare triple {40428#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 65: Hoare triple {40428#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {40428#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {40428#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {40428#false} assume 8448 == #t~mem68;havoc #t~mem68; {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {40428#false} assume !(~num1~0 > 0); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 70: Hoare triple {40428#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {40428#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {40428#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 74: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {40428#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {40428#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 77: Hoare triple {40428#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 78: Hoare triple {40428#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 79: Hoare triple {40428#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,523 INFO L290 TraceCheckUtils]: 80: Hoare triple {40428#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {40428#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 82: Hoare triple {40428#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {40428#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 84: Hoare triple {40428#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 85: Hoare triple {40428#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 86: Hoare triple {40428#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 87: Hoare triple {40428#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 88: Hoare triple {40428#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 89: Hoare triple {40428#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 90: Hoare triple {40428#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {40428#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {40428#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {40428#false} assume 8544 == #t~mem64;havoc #t~mem64; {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {40428#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {40428#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {40428#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {40428#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {40428#false} is VALID [2022-04-28 15:29:25,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {40428#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {40428#false} is VALID [2022-04-28 15:29:25,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {40428#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {40428#false} is VALID [2022-04-28 15:29:25,525 INFO L290 TraceCheckUtils]: 100: Hoare triple {40428#false} assume 8 == ~blastFlag~0; {40428#false} is VALID [2022-04-28 15:29:25,525 INFO L290 TraceCheckUtils]: 101: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:29:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:25,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676119578] [2022-04-28 15:29:25,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676119578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:25,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:25,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:25,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:25,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13473314] [2022-04-28 15:29:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13473314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:25,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:25,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986815099] [2022-04-28 15:29:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:25,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 15:29:25,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:25,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:25,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:25,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:25,577 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:33,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:35,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:36,818 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-28 15:29:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:36,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 15:29:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:29:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:29:36,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:29:37,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:37,104 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:29:37,104 INFO L226 Difference]: Without dead ends: 326 [2022-04-28 15:29:37,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:37,105 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:37,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 15:29:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-28 15:29:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-28 15:29:37,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:37,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:37,135 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:37,135 INFO L87 Difference]: Start difference. First operand 326 states. Second operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:37,139 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:29:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:29:37,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:37,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:37,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-28 15:29:37,140 INFO L87 Difference]: Start difference. First operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 326 states. [2022-04-28 15:29:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:37,144 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:29:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:29:37,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:37,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:37,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:37,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 304 states have (on average 1.5394736842105263) internal successors, (468), 304 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-28 15:29:37,149 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-28 15:29:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:37,149 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-28 15:29:37,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:37,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-28 15:29:37,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-28 15:29:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 15:29:37,521 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:37,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:37,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:29:37,522 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash 835621588, now seen corresponding path program 1 times [2022-04-28 15:29:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:37,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200694675] [2022-04-28 15:29:37,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:37,576 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 835621588, now seen corresponding path program 2 times [2022-04-28 15:29:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:37,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351351569] [2022-04-28 15:29:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:37,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:37,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42927#true} is VALID [2022-04-28 15:29:37,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-28 15:29:37,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42927#true} {42927#true} #689#return; {42927#true} is VALID [2022-04-28 15:29:37,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {42927#true} call ULTIMATE.init(); {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:37,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {42934#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42927#true} is VALID [2022-04-28 15:29:37,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-28 15:29:37,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42927#true} {42927#true} #689#return; {42927#true} is VALID [2022-04-28 15:29:37,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {42927#true} call #t~ret161 := main(); {42927#true} is VALID [2022-04-28 15:29:37,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {42927#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {42927#true} is VALID [2022-04-28 15:29:37,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {42927#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L272 TraceCheckUtils]: 7: Hoare triple {42927#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {42927#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {42927#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {42927#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {42927#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {42927#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {42927#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {42927#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {42927#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {42927#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {42927#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {42927#true} assume 8464 == #t~mem55;havoc #t~mem55; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {42927#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {42927#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {42927#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {42927#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {42927#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {42927#true} ~skip~0 := 0; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {42927#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {42927#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {42927#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {42927#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {42927#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {42927#true} assume 8195 == #t~mem51;havoc #t~mem51; {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {42927#true} call write~int(1, ~s.base, 56 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {42927#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {42927#true} is VALID [2022-04-28 15:29:37,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {42927#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {42927#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {42927#true} is VALID [2022-04-28 15:29:37,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {42927#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {42927#true} is VALID [2022-04-28 15:29:37,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {42927#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {42927#true} is VALID [2022-04-28 15:29:37,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {42927#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem89 := read~int(#t~mem88.base, 132 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 132 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} ~skip~0 := 0; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !false; {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {42932#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42933#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {42933#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 57: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 60: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 61: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 64: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 65: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 66: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 67: Hoare triple {42928#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 68: Hoare triple {42928#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 69: Hoare triple {42928#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 70: Hoare triple {42928#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 71: Hoare triple {42928#false} assume 8448 == #t~mem68;havoc #t~mem68; {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 72: Hoare triple {42928#false} assume !(~num1~0 > 0); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {42928#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {42928#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {42928#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 76: Hoare triple {42928#false} ~skip~0 := 0; {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 77: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {42928#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {42928#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {42928#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {42928#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {42928#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {42928#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 84: Hoare triple {42928#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 85: Hoare triple {42928#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 86: Hoare triple {42928#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {42928#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 88: Hoare triple {42928#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 89: Hoare triple {42928#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 90: Hoare triple {42928#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 91: Hoare triple {42928#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 92: Hoare triple {42928#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 93: Hoare triple {42928#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 94: Hoare triple {42928#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 95: Hoare triple {42928#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 96: Hoare triple {42928#false} assume 8544 == #t~mem64;havoc #t~mem64; {42928#false} is VALID [2022-04-28 15:29:37,711 INFO L290 TraceCheckUtils]: 97: Hoare triple {42928#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 98: Hoare triple {42928#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 99: Hoare triple {42928#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 100: Hoare triple {42928#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 101: Hoare triple {42928#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 102: Hoare triple {42928#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 103: Hoare triple {42928#false} assume 8 == ~blastFlag~0; {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L290 TraceCheckUtils]: 104: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-28 15:29:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 15:29:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:37,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351351569] [2022-04-28 15:29:37,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351351569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:37,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:37,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:37,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:37,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200694675] [2022-04-28 15:29:37,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200694675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:37,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:37,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:37,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317411633] [2022-04-28 15:29:37,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:37,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-28 15:29:37,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:37,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:37,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:37,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:37,783 INFO L87 Difference]: Start difference. First operand 309 states and 472 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:39,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:40,811 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-28 15:29:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-28 15:29:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:29:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:40,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:29:40,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:29:41,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 449 edges. 449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:41,086 INFO L225 Difference]: With dead ends: 620 [2022-04-28 15:29:41,086 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:29:41,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:41,087 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:41,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:29:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:29:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-28 15:29:41,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:41,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:41,100 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:41,100 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:41,105 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:29:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:29:41,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:41,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:41,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-28 15:29:41,106 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-28 15:29:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:41,110 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:29:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:29:41,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:41,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:41,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:41,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.53125) internal successors, (490), 320 states have internal predecessors, (490), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-28 15:29:41,117 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-28 15:29:41,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:41,117 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-28 15:29:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:41,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-28 15:29:41,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-28 15:29:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 15:29:41,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:41,560 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:29:41,560 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash -944097683, now seen corresponding path program 1 times [2022-04-28 15:29:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14320928] [2022-04-28 15:29:41,624 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:41,625 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -944097683, now seen corresponding path program 2 times [2022-04-28 15:29:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:41,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153914634] [2022-04-28 15:29:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:41,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45503#true} is VALID [2022-04-28 15:29:41,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-28 15:29:41,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45503#true} {45503#true} #689#return; {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {45503#true} call ULTIMATE.init(); {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {45510#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45503#true} {45503#true} #689#return; {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {45503#true} call #t~ret161 := main(); {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {45503#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {45503#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L272 TraceCheckUtils]: 7: Hoare triple {45503#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {45503#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {45503#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {45503#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {45503#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45503#true} is VALID [2022-04-28 15:29:41,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {45503#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {45503#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {45503#true} assume !false; {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {45503#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {45503#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {45503#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {45503#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {45503#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {45503#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {45503#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {45503#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {45503#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {45503#true} assume 8464 == #t~mem55;havoc #t~mem55; {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {45503#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {45503#true} is VALID [2022-04-28 15:29:41,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {45503#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45503#true} is VALID [2022-04-28 15:29:41,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {45503#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {45508#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45509#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {45509#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {45504#false} call write~int(1, ~s.base, 56 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {45504#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {45504#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {45504#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 42: Hoare triple {45504#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset; {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 43: Hoare triple {45504#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,741 INFO L290 TraceCheckUtils]: 44: Hoare triple {45504#false} assume 12292 != #t~mem85;havoc #t~mem85; {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {45504#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 72 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem87 := read~int(#t~mem86.base, 128 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 128 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 46: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 47: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 55: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,742 INFO L290 TraceCheckUtils]: 61: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 62: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 63: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 64: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 65: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {45504#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 69: Hoare triple {45504#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 70: Hoare triple {45504#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 71: Hoare triple {45504#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 72: Hoare triple {45504#false} assume 8448 == #t~mem68;havoc #t~mem68; {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 73: Hoare triple {45504#false} assume !(~num1~0 > 0); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 74: Hoare triple {45504#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 75: Hoare triple {45504#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 76: Hoare triple {45504#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:29:41,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {45504#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {45504#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 81: Hoare triple {45504#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 82: Hoare triple {45504#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 83: Hoare triple {45504#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 84: Hoare triple {45504#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 85: Hoare triple {45504#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 86: Hoare triple {45504#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 87: Hoare triple {45504#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 88: Hoare triple {45504#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 89: Hoare triple {45504#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 90: Hoare triple {45504#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 91: Hoare triple {45504#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 92: Hoare triple {45504#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 93: Hoare triple {45504#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 94: Hoare triple {45504#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 95: Hoare triple {45504#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,744 INFO L290 TraceCheckUtils]: 96: Hoare triple {45504#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 97: Hoare triple {45504#false} assume 8544 == #t~mem64;havoc #t~mem64; {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 98: Hoare triple {45504#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 99: Hoare triple {45504#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 100: Hoare triple {45504#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 101: Hoare triple {45504#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 102: Hoare triple {45504#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 103: Hoare triple {45504#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 104: Hoare triple {45504#false} assume 8 == ~blastFlag~0; {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L290 TraceCheckUtils]: 105: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:29:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 15:29:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:41,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153914634] [2022-04-28 15:29:41,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153914634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:41,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:41,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:41,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14320928] [2022-04-28 15:29:41,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14320928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:41,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:41,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004242584] [2022-04-28 15:29:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:41,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 15:29:41,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:41,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:41,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:41,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:41,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:41,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:41,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:41,801 INFO L87 Difference]: Start difference. First operand 325 states and 494 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:43,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-28 15:29:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:44,971 INFO L93 Difference]: Finished difference Result 692 states and 1055 transitions. [2022-04-28 15:29:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-28 15:29:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:29:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:29:44,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-28 15:29:45,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:45,338 INFO L225 Difference]: With dead ends: 692 [2022-04-28 15:29:45,338 INFO L226 Difference]: Without dead ends: 393 [2022-04-28 15:29:45,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:45,339 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:45,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 408 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:29:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-28 15:29:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2022-04-28 15:29:45,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:45,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:45,360 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:45,361 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:45,367 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-28 15:29:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-28 15:29:45,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:45,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:45,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-28 15:29:45,368 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 393 states. [2022-04-28 15:29:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:45,374 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-28 15:29:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-28 15:29:45,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:45,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:45,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:45,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.5125) internal successors, (484), 320 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-28 15:29:45,380 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-28 15:29:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:45,380 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-28 15:29:45,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:45,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-28 15:29:45,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-28 15:29:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 15:29:45,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:45,759 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:45,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:29:45,759 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:45,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 1 times [2022-04-28 15:29:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:45,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1567920552] [2022-04-28 15:29:45,839 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:45,839 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:45,839 INFO L85 PathProgramCache]: Analyzing trace with hash 623048725, now seen corresponding path program 2 times [2022-04-28 15:29:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:45,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510365061] [2022-04-28 15:29:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:45,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48335#true} is VALID [2022-04-28 15:29:45,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-28 15:29:45,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48335#true} {48335#true} #689#return; {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {48335#true} call ULTIMATE.init(); {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:45,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {48342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48335#true} {48335#true} #689#return; {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {48335#true} call #t~ret161 := main(); {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {48335#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {48335#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L272 TraceCheckUtils]: 7: Hoare triple {48335#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {48335#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {48335#true} is VALID [2022-04-28 15:29:45,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {48335#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {48335#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {48335#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {48335#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {48335#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {48335#true} assume 8464 == #t~mem55;havoc #t~mem55; {48335#true} is VALID [2022-04-28 15:29:45,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {48335#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {48335#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {48335#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {48335#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {48335#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {48335#true} ~skip~0 := 0; {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {48335#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {48335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {48335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {48335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {48335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {48335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {48335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {48335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {48335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {48335#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {48335#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {48335#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {48335#true} assume 8496 == #t~mem58;havoc #t~mem58; {48335#true} is VALID [2022-04-28 15:29:45,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {48335#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {48335#true} is VALID [2022-04-28 15:29:45,947 INFO L290 TraceCheckUtils]: 46: Hoare triple {48335#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48335#true} is VALID [2022-04-28 15:29:45,947 INFO L290 TraceCheckUtils]: 47: Hoare triple {48335#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {48335#true} is VALID [2022-04-28 15:29:45,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {48335#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,948 INFO L290 TraceCheckUtils]: 49: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} ~skip~0 := 0; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !false; {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,950 INFO L290 TraceCheckUtils]: 54: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,950 INFO L290 TraceCheckUtils]: 55: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,950 INFO L290 TraceCheckUtils]: 56: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,951 INFO L290 TraceCheckUtils]: 57: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,956 INFO L290 TraceCheckUtils]: 60: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,957 INFO L290 TraceCheckUtils]: 63: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,957 INFO L290 TraceCheckUtils]: 64: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,958 INFO L290 TraceCheckUtils]: 68: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,959 INFO L290 TraceCheckUtils]: 69: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 75: Hoare triple {48340#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {48341#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 77: Hoare triple {48336#false} assume !(~num1~0 > 0); {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 78: Hoare triple {48336#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 79: Hoare triple {48336#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 80: Hoare triple {48336#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 81: Hoare triple {48336#false} ~skip~0 := 0; {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 82: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 83: Hoare triple {48336#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 84: Hoare triple {48336#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 85: Hoare triple {48336#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 86: Hoare triple {48336#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,961 INFO L290 TraceCheckUtils]: 87: Hoare triple {48336#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 88: Hoare triple {48336#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 89: Hoare triple {48336#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 90: Hoare triple {48336#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 91: Hoare triple {48336#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 92: Hoare triple {48336#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 93: Hoare triple {48336#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 94: Hoare triple {48336#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 95: Hoare triple {48336#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 96: Hoare triple {48336#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 97: Hoare triple {48336#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 98: Hoare triple {48336#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 99: Hoare triple {48336#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 100: Hoare triple {48336#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 101: Hoare triple {48336#false} assume 8544 == #t~mem64;havoc #t~mem64; {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 102: Hoare triple {48336#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {48336#false} is VALID [2022-04-28 15:29:45,962 INFO L290 TraceCheckUtils]: 103: Hoare triple {48336#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L290 TraceCheckUtils]: 104: Hoare triple {48336#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L290 TraceCheckUtils]: 105: Hoare triple {48336#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L290 TraceCheckUtils]: 106: Hoare triple {48336#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L290 TraceCheckUtils]: 107: Hoare triple {48336#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L290 TraceCheckUtils]: 108: Hoare triple {48336#false} assume 8 == ~blastFlag~0; {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L290 TraceCheckUtils]: 109: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-28 15:29:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:29:45,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:45,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510365061] [2022-04-28 15:29:45,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510365061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:45,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:45,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:45,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:45,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1567920552] [2022-04-28 15:29:45,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1567920552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:45,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:45,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340945466] [2022-04-28 15:29:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:45,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 15:29:45,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:45,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:46,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:46,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:46,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:46,041 INFO L87 Difference]: Start difference. First operand 325 states and 488 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:49,792 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-28 15:29:51,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:53,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:29:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:57,118 INFO L93 Difference]: Finished difference Result 768 states and 1165 transitions. [2022-04-28 15:29:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:29:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-28 15:29:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:29:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:29:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:29:57,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:29:57,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 570 edges. 570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:57,507 INFO L225 Difference]: With dead ends: 768 [2022-04-28 15:29:57,508 INFO L226 Difference]: Without dead ends: 469 [2022-04-28 15:29:57,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:29:57,509 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:29:57,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 472 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 15:29:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-28 15:29:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 389. [2022-04-28 15:29:57,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:29:57,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,527 INFO L74 IsIncluded]: Start isIncluded. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,528 INFO L87 Difference]: Start difference. First operand 469 states. Second operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:57,536 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-28 15:29:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-28 15:29:57,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:57,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:57,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-28 15:29:57,537 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 469 states. [2022-04-28 15:29:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:29:57,546 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-28 15:29:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-28 15:29:57,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:29:57,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:29:57,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:29:57,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:29:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5104166666666667) internal successors, (580), 384 states have internal predecessors, (580), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-28 15:29:57,555 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-28 15:29:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:29:57,555 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-28 15:29:57,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:57,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-28 15:29:58,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-28 15:29:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-28 15:29:58,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:29:58,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:29:58,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:29:58,057 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:29:58,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:29:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 1 times [2022-04-28 15:29:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:58,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984554914] [2022-04-28 15:29:58,126 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:29:58,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:29:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1495666253, now seen corresponding path program 2 times [2022-04-28 15:29:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:29:58,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520182311] [2022-04-28 15:29:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:29:58,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:29:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:58,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:29:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:29:58,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51599#true} is VALID [2022-04-28 15:29:58,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-28 15:29:58,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51599#true} {51599#true} #689#return; {51599#true} is VALID [2022-04-28 15:29:58,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {51599#true} call ULTIMATE.init(); {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:29:58,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {51606#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {51599#true} is VALID [2022-04-28 15:29:58,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-28 15:29:58,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51599#true} {51599#true} #689#return; {51599#true} is VALID [2022-04-28 15:29:58,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {51599#true} call #t~ret161 := main(); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {51599#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {51599#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L272 TraceCheckUtils]: 7: Hoare triple {51599#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {51599#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {51599#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {51599#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {51599#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {51599#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {51599#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {51599#true} assume 8464 == #t~mem55;havoc #t~mem55; {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {51599#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {51599#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {51599#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {51599#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {51599#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {51599#true} ~skip~0 := 0; {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {51599#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {51599#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {51599#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {51599#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {51599#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {51599#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {51599#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {51599#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {51599#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {51599#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {51599#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {51599#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {51599#true} assume 8496 == #t~mem58;havoc #t~mem58; {51599#true} is VALID [2022-04-28 15:29:58,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {51599#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {51599#true} is VALID [2022-04-28 15:29:58,246 INFO L290 TraceCheckUtils]: 46: Hoare triple {51599#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51599#true} is VALID [2022-04-28 15:29:58,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {51599#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {51599#true} is VALID [2022-04-28 15:29:58,247 INFO L290 TraceCheckUtils]: 48: Hoare triple {51599#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} ~skip~0 := 0; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !false; {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,253 INFO L290 TraceCheckUtils]: 62: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,254 INFO L290 TraceCheckUtils]: 64: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,254 INFO L290 TraceCheckUtils]: 65: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,254 INFO L290 TraceCheckUtils]: 66: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,255 INFO L290 TraceCheckUtils]: 67: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,255 INFO L290 TraceCheckUtils]: 68: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,258 INFO L290 TraceCheckUtils]: 76: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,259 INFO L290 TraceCheckUtils]: 77: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,259 INFO L290 TraceCheckUtils]: 78: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,260 INFO L290 TraceCheckUtils]: 79: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} is VALID [2022-04-28 15:29:58,260 INFO L290 TraceCheckUtils]: 80: Hoare triple {51604#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8608))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51605#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 15:29:58,260 INFO L290 TraceCheckUtils]: 81: Hoare triple {51605#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {51600#false} is VALID [2022-04-28 15:29:58,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {51600#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 83: Hoare triple {51600#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 84: Hoare triple {51600#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 85: Hoare triple {51600#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 86: Hoare triple {51600#false} ~skip~0 := 0; {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 87: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 88: Hoare triple {51600#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 89: Hoare triple {51600#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 90: Hoare triple {51600#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 91: Hoare triple {51600#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 92: Hoare triple {51600#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 93: Hoare triple {51600#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 94: Hoare triple {51600#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 95: Hoare triple {51600#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,261 INFO L290 TraceCheckUtils]: 96: Hoare triple {51600#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 97: Hoare triple {51600#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 98: Hoare triple {51600#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 99: Hoare triple {51600#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 100: Hoare triple {51600#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 101: Hoare triple {51600#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 102: Hoare triple {51600#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 103: Hoare triple {51600#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 104: Hoare triple {51600#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {51600#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 106: Hoare triple {51600#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 107: Hoare triple {51600#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 108: Hoare triple {51600#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 109: Hoare triple {51600#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,262 INFO L290 TraceCheckUtils]: 110: Hoare triple {51600#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 111: Hoare triple {51600#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 112: Hoare triple {51600#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 113: Hoare triple {51600#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 114: Hoare triple {51600#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 115: Hoare triple {51600#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 116: Hoare triple {51600#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 117: Hoare triple {51600#false} assume 8640 == #t~mem75;havoc #t~mem75; {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 118: Hoare triple {51600#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 119: Hoare triple {51600#false} assume 4 == ~blastFlag~0; {51600#false} is VALID [2022-04-28 15:29:58,263 INFO L290 TraceCheckUtils]: 120: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-28 15:29:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:29:58,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:29:58,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520182311] [2022-04-28 15:29:58,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520182311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:58,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:58,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:58,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:29:58,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984554914] [2022-04-28 15:29:58,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984554914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:29:58,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:29:58,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:29:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952023545] [2022-04-28 15:29:58,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:29:58,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-28 15:29:58,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:29:58,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:29:58,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:29:58,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:29:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:29:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:29:58,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:29:58,345 INFO L87 Difference]: Start difference. First operand 389 states and 584 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:02,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:04,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:06,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:07,895 INFO L93 Difference]: Finished difference Result 860 states and 1297 transitions. [2022-04-28 15:30:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:07,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-28 15:30:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:30:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:30:07,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-28 15:30:08,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:08,275 INFO L225 Difference]: With dead ends: 860 [2022-04-28 15:30:08,275 INFO L226 Difference]: Without dead ends: 497 [2022-04-28 15:30:08,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:08,276 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 111 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:08,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 392 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 476 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 15:30:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-28 15:30:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 426. [2022-04-28 15:30:08,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:08,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:08,298 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:08,298 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:08,307 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-28 15:30:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-28 15:30:08,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:08,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:08,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:30:08,309 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:30:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:08,318 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-28 15:30:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-28 15:30:08,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:08,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:08,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:08,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.510688836104513) internal successors, (636), 421 states have internal predecessors, (636), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-28 15:30:08,328 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 121 [2022-04-28 15:30:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:08,328 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-28 15:30:08,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:08,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-28 15:30:08,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-28 15:30:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:30:08,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:08,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:08,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:30:08,940 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 1 times [2022-04-28 15:30:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:08,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [268770310] [2022-04-28 15:30:09,027 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:09,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash 370746785, now seen corresponding path program 2 times [2022-04-28 15:30:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384792663] [2022-04-28 15:30:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:09,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {55177#true} is VALID [2022-04-28 15:30:09,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-28 15:30:09,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55177#true} {55177#true} #689#return; {55177#true} is VALID [2022-04-28 15:30:09,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {55177#true} call ULTIMATE.init(); {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:30:09,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {55184#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {55177#true} is VALID [2022-04-28 15:30:09,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-28 15:30:09,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55177#true} {55177#true} #689#return; {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {55177#true} call #t~ret161 := main(); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {55177#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {55177#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L272 TraceCheckUtils]: 7: Hoare triple {55177#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {55177#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {55177#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {55177#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {55177#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {55177#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {55177#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {55177#true} assume 8464 == #t~mem55;havoc #t~mem55; {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {55177#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {55177#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 27: Hoare triple {55177#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {55177#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {55177#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {55177#true} ~skip~0 := 0; {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {55177#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {55177#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {55177#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {55177#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {55177#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {55177#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {55177#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {55177#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {55177#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {55177#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {55177#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {55177#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {55177#true} assume 8496 == #t~mem58;havoc #t~mem58; {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {55177#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {55177#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55177#true} is VALID [2022-04-28 15:30:09,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {55177#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {55177#true} is VALID [2022-04-28 15:30:09,187 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)) 8609))} is VALID [2022-04-28 15:30:09,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} ~skip~0 := 0; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !false; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,189 INFO L290 TraceCheckUtils]: 55: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} 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)) 8609))} is VALID [2022-04-28 15:30:09,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,193 INFO L290 TraceCheckUtils]: 66: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,194 INFO L290 TraceCheckUtils]: 69: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,194 INFO L290 TraceCheckUtils]: 70: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,194 INFO L290 TraceCheckUtils]: 71: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,195 INFO L290 TraceCheckUtils]: 72: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,195 INFO L290 TraceCheckUtils]: 73: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,195 INFO L290 TraceCheckUtils]: 74: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,196 INFO L290 TraceCheckUtils]: 77: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,197 INFO L290 TraceCheckUtils]: 78: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} is VALID [2022-04-28 15:30:09,197 INFO L290 TraceCheckUtils]: 81: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {55183#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 82: Hoare triple {55183#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 83: Hoare triple {55178#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 84: Hoare triple {55178#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); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 85: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 86: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 87: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 88: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 89: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 90: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 91: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 92: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 93: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,198 INFO L290 TraceCheckUtils]: 95: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 99: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 100: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 101: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 102: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 103: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 104: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 105: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 106: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 107: Hoare triple {55178#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 108: Hoare triple {55178#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 109: Hoare triple {55178#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 110: Hoare triple {55178#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 111: Hoare triple {55178#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 112: Hoare triple {55178#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,199 INFO L290 TraceCheckUtils]: 113: Hoare triple {55178#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 114: Hoare triple {55178#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 115: Hoare triple {55178#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 116: Hoare triple {55178#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 117: Hoare triple {55178#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 118: Hoare triple {55178#false} assume 8640 == #t~mem75;havoc #t~mem75; {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 119: Hoare triple {55178#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 120: Hoare triple {55178#false} assume 4 == ~blastFlag~0; {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L290 TraceCheckUtils]: 121: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:30:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:30:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384792663] [2022-04-28 15:30:09,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384792663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:09,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:09,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:09,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:09,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [268770310] [2022-04-28 15:30:09,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [268770310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:09,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:09,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22770999] [2022-04-28 15:30:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:09,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 15:30:09,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:09,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:09,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:09,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:09,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:09,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:09,277 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:12,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:14,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:16,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:18,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:19,980 INFO L93 Difference]: Finished difference Result 894 states and 1347 transitions. [2022-04-28 15:30:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2022-04-28 15:30:19,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:19,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:30:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:30:19,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-28 15:30:20,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:20,359 INFO L225 Difference]: With dead ends: 894 [2022-04-28 15:30:20,359 INFO L226 Difference]: Without dead ends: 494 [2022-04-28 15:30:20,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:20,360 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 110 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:20,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 408 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:30:20,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-04-28 15:30:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 426. [2022-04-28 15:30:20,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:20,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 494 states. Second operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,382 INFO L74 IsIncluded]: Start isIncluded. First operand 494 states. Second operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,382 INFO L87 Difference]: Start difference. First operand 494 states. Second operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:20,391 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2022-04-28 15:30:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 735 transitions. [2022-04-28 15:30:20,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:20,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:20,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 494 states. [2022-04-28 15:30:20,392 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 494 states. [2022-04-28 15:30:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:20,401 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2022-04-28 15:30:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 735 transitions. [2022-04-28 15:30:20,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:20,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:20,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:20,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.505938242280285) internal successors, (634), 421 states have internal predecessors, (634), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 638 transitions. [2022-04-28 15:30:20,414 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 638 transitions. Word has length 122 [2022-04-28 15:30:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:20,414 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 638 transitions. [2022-04-28 15:30:20,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:20,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 638 transitions. [2022-04-28 15:30:20,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 638 transitions. [2022-04-28 15:30:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:30:20,982 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:20,983 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:20,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:30:20,983 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 974158647, now seen corresponding path program 1 times [2022-04-28 15:30:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:20,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1896396843] [2022-04-28 15:30:21,048 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:21,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 974158647, now seen corresponding path program 2 times [2022-04-28 15:30:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:21,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228141625] [2022-04-28 15:30:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:21,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {58824#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {58817#true} is VALID [2022-04-28 15:30:21,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {58817#true} assume true; {58817#true} is VALID [2022-04-28 15:30:21,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58817#true} {58817#true} #689#return; {58817#true} is VALID [2022-04-28 15:30:21,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {58817#true} call ULTIMATE.init(); {58824#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:30:21,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {58824#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {58817#true} is VALID [2022-04-28 15:30:21,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {58817#true} assume true; {58817#true} is VALID [2022-04-28 15:30:21,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58817#true} {58817#true} #689#return; {58817#true} is VALID [2022-04-28 15:30:21,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {58817#true} call #t~ret161 := main(); {58817#true} is VALID [2022-04-28 15:30:21,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {58817#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; {58817#true} is VALID [2022-04-28 15:30:21,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {58817#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L272 TraceCheckUtils]: 7: Hoare triple {58817#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {58817#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); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {58817#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; {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {58817#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; {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {58817#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {58817#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {58817#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {58817#true} assume !false; {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {58817#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); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {58817#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {58817#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {58817#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {58817#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {58817#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {58817#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {58817#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {58817#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {58817#true} assume 8464 == #t~mem55;havoc #t~mem55; {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {58817#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; {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {58817#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {58817#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); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {58817#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); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {58817#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {58817#true} ~skip~0 := 0; {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {58817#true} assume !false; {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {58817#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); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {58817#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {58817#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {58817#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {58817#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 37: Hoare triple {58817#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {58817#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {58817#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {58817#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {58817#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {58817#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {58817#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {58817#true} assume 8496 == #t~mem58;havoc #t~mem58; {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {58817#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {58817#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58817#true} is VALID [2022-04-28 15:30:21,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {58817#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {58817#true} is VALID [2022-04-28 15:30:21,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {58817#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {58822#(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; {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,189 INFO L290 TraceCheckUtils]: 54: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {58822#(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); {58822#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 59: Hoare triple {58822#(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); {58823#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {58823#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {58818#false} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {58818#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; {58818#false} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 62: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 63: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,191 INFO L290 TraceCheckUtils]: 64: Hoare triple {58818#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {58818#false} ~skip~0 := 0; {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {58818#false} assume !false; {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 67: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {58818#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {58818#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 70: Hoare triple {58818#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 71: Hoare triple {58818#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 72: Hoare triple {58818#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 73: Hoare triple {58818#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 74: Hoare triple {58818#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 75: Hoare triple {58818#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 76: Hoare triple {58818#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 77: Hoare triple {58818#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 78: Hoare triple {58818#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {58818#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {58818#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,192 INFO L290 TraceCheckUtils]: 81: Hoare triple {58818#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {58818#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 83: Hoare triple {58818#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {58818#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 85: Hoare triple {58818#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {58818#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 87: Hoare triple {58818#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 88: Hoare triple {58818#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 89: Hoare triple {58818#false} assume 8448 == #t~mem68;havoc #t~mem68; {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 90: Hoare triple {58818#false} assume !(~num1~0 > 0); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 91: Hoare triple {58818#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; {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 92: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 93: Hoare triple {58818#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 94: Hoare triple {58818#false} ~skip~0 := 0; {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 95: Hoare triple {58818#false} assume !false; {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 96: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 97: Hoare triple {58818#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 98: Hoare triple {58818#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,193 INFO L290 TraceCheckUtils]: 99: Hoare triple {58818#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 100: Hoare triple {58818#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 101: Hoare triple {58818#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 102: Hoare triple {58818#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 103: Hoare triple {58818#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 104: Hoare triple {58818#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 105: Hoare triple {58818#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 106: Hoare triple {58818#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 107: Hoare triple {58818#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 108: Hoare triple {58818#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 109: Hoare triple {58818#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 110: Hoare triple {58818#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 111: Hoare triple {58818#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 112: Hoare triple {58818#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 113: Hoare triple {58818#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 114: Hoare triple {58818#false} assume 8544 == #t~mem64;havoc #t~mem64; {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 115: Hoare triple {58818#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {58818#false} is VALID [2022-04-28 15:30:21,194 INFO L290 TraceCheckUtils]: 116: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L290 TraceCheckUtils]: 117: Hoare triple {58818#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L290 TraceCheckUtils]: 118: Hoare triple {58818#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); {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L290 TraceCheckUtils]: 119: Hoare triple {58818#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; {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L290 TraceCheckUtils]: 120: Hoare triple {58818#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; {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L290 TraceCheckUtils]: 121: Hoare triple {58818#false} assume 8 == ~blastFlag~0; {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L290 TraceCheckUtils]: 122: Hoare triple {58818#false} assume !false; {58818#false} is VALID [2022-04-28 15:30:21,195 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-28 15:30:21,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:21,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228141625] [2022-04-28 15:30:21,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228141625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:21,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:21,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:21,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1896396843] [2022-04-28 15:30:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1896396843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:21,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:21,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429787621] [2022-04-28 15:30:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:30:21,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:21,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:21,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:21,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:21,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:21,259 INFO L87 Difference]: Start difference. First operand 426 states and 638 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:23,160 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-28 15:30:26,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:32,411 INFO L93 Difference]: Finished difference Result 892 states and 1341 transitions. [2022-04-28 15:30:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:30:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:32,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:30:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-04-28 15:30:32,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 571 transitions. [2022-04-28 15:30:32,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 571 edges. 571 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:32,801 INFO L225 Difference]: With dead ends: 892 [2022-04-28 15:30:32,802 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 15:30:32,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:32,803 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 131 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:32,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 15:30:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 15:30:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-28 15:30:32,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:32,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,825 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,825 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:32,833 INFO L93 Difference]: Finished difference Result 492 states and 726 transitions. [2022-04-28 15:30:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 726 transitions. [2022-04-28 15:30:32,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:32,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:32,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 15:30:32,835 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 15:30:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:32,843 INFO L93 Difference]: Finished difference Result 492 states and 726 transitions. [2022-04-28 15:30:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 726 transitions. [2022-04-28 15:30:32,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:32,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:32,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:32,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.489311163895487) internal successors, (627), 421 states have internal predecessors, (627), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 631 transitions. [2022-04-28 15:30:32,852 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 631 transitions. Word has length 123 [2022-04-28 15:30:32,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:32,852 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 631 transitions. [2022-04-28 15:30:32,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:32,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 631 transitions. [2022-04-28 15:30:33,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 631 transitions. [2022-04-28 15:30:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 15:30:33,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:33,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:33,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:30:33,398 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash -149695392, now seen corresponding path program 1 times [2022-04-28 15:30:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:33,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [454059861] [2022-04-28 15:30:33,467 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:33,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash -149695392, now seen corresponding path program 2 times [2022-04-28 15:30:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:33,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617211308] [2022-04-28 15:30:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:33,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:33,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {62456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {62449#true} is VALID [2022-04-28 15:30:33,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {62449#true} assume true; {62449#true} is VALID [2022-04-28 15:30:33,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62449#true} {62449#true} #689#return; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {62449#true} call ULTIMATE.init(); {62456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {62456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {62449#true} assume true; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62449#true} {62449#true} #689#return; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {62449#true} call #t~ret161 := main(); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {62449#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; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {62449#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L272 TraceCheckUtils]: 7: Hoare triple {62449#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {62449#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); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {62449#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; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {62449#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; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {62449#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {62449#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {62449#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {62449#true} assume !false; {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {62449#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); {62449#true} is VALID [2022-04-28 15:30:33,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {62449#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {62449#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {62449#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {62449#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {62449#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {62449#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {62449#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {62449#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {62449#true} assume 8464 == #t~mem55;havoc #t~mem55; {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {62449#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; {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {62449#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {62449#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); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {62449#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); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {62449#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {62449#true} ~skip~0 := 0; {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 31: Hoare triple {62449#true} assume !false; {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {62449#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); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {62449#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {62449#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {62449#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {62449#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {62449#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {62449#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {62449#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {62449#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {62449#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {62449#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {62449#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {62449#true} assume 8496 == #t~mem58;havoc #t~mem58; {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {62449#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {62449#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62449#true} is VALID [2022-04-28 15:30:33,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {62449#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {62449#true} is VALID [2022-04-28 15:30:33,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {62449#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {62454#(not (= (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; {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} ~skip~0 := 0; {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !false; {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,604 INFO L290 TraceCheckUtils]: 54: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,605 INFO L290 TraceCheckUtils]: 58: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,606 INFO L290 TraceCheckUtils]: 59: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,607 INFO L290 TraceCheckUtils]: 62: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,607 INFO L290 TraceCheckUtils]: 63: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,607 INFO L290 TraceCheckUtils]: 64: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,608 INFO L290 TraceCheckUtils]: 65: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,608 INFO L290 TraceCheckUtils]: 67: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,609 INFO L290 TraceCheckUtils]: 68: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,609 INFO L290 TraceCheckUtils]: 69: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,609 INFO L290 TraceCheckUtils]: 70: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,610 INFO L290 TraceCheckUtils]: 71: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,610 INFO L290 TraceCheckUtils]: 72: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,610 INFO L290 TraceCheckUtils]: 73: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,611 INFO L290 TraceCheckUtils]: 74: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,611 INFO L290 TraceCheckUtils]: 76: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,612 INFO L290 TraceCheckUtils]: 80: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,613 INFO L290 TraceCheckUtils]: 81: Hoare triple {62454#(not (= (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); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,613 INFO L290 TraceCheckUtils]: 82: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,613 INFO L290 TraceCheckUtils]: 83: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,614 INFO L290 TraceCheckUtils]: 84: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,614 INFO L290 TraceCheckUtils]: 85: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} is VALID [2022-04-28 15:30:33,614 INFO L290 TraceCheckUtils]: 86: Hoare triple {62454#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {62455#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 87: Hoare triple {62455#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 88: Hoare triple {62450#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 89: Hoare triple {62450#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 90: Hoare triple {62450#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); {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 91: Hoare triple {62450#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; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 92: Hoare triple {62450#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 93: Hoare triple {62450#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); {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 94: Hoare triple {62450#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 95: Hoare triple {62450#false} ~skip~0 := 0; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 96: Hoare triple {62450#false} assume !false; {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 97: Hoare triple {62450#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); {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 98: Hoare triple {62450#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,615 INFO L290 TraceCheckUtils]: 99: Hoare triple {62450#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 100: Hoare triple {62450#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 101: Hoare triple {62450#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 102: Hoare triple {62450#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 103: Hoare triple {62450#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 104: Hoare triple {62450#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 105: Hoare triple {62450#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 106: Hoare triple {62450#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 107: Hoare triple {62450#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 108: Hoare triple {62450#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 109: Hoare triple {62450#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 110: Hoare triple {62450#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 111: Hoare triple {62450#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 112: Hoare triple {62450#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 113: Hoare triple {62450#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 114: Hoare triple {62450#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 115: Hoare triple {62450#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,616 INFO L290 TraceCheckUtils]: 116: Hoare triple {62450#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 117: Hoare triple {62450#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 118: Hoare triple {62450#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {62450#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 120: Hoare triple {62450#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 121: Hoare triple {62450#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 122: Hoare triple {62450#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 123: Hoare triple {62450#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 124: Hoare triple {62450#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 125: Hoare triple {62450#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 126: Hoare triple {62450#false} assume 8640 == #t~mem75;havoc #t~mem75; {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 127: Hoare triple {62450#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 128: Hoare triple {62450#false} assume 4 == ~blastFlag~0; {62450#false} is VALID [2022-04-28 15:30:33,617 INFO L290 TraceCheckUtils]: 129: Hoare triple {62450#false} assume !false; {62450#false} is VALID [2022-04-28 15:30:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:30:33,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:33,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617211308] [2022-04-28 15:30:33,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617211308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:33,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:33,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:33,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:33,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [454059861] [2022-04-28 15:30:33,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [454059861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:33,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:33,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:33,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573616310] [2022-04-28 15:30:33,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:33,619 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-28 15:30:33,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:33,619 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-28 15:30:33,695 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-28 15:30:33,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:33,696 INFO L87 Difference]: Start difference. First operand 426 states and 631 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-28 15:30:35,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:37,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:39,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:41,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:43,299 INFO L93 Difference]: Finished difference Result 934 states and 1388 transitions. [2022-04-28 15:30:43,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:43,299 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-28 15:30:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:43,299 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-28 15:30:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-28 15:30:43,302 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-28 15:30:43,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-04-28 15:30:43,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 573 transitions. [2022-04-28 15:30:43,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 573 edges. 573 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:43,735 INFO L225 Difference]: With dead ends: 934 [2022-04-28 15:30:43,735 INFO L226 Difference]: Without dead ends: 534 [2022-04-28 15:30:43,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:43,736 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 103 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 54 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:43,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 365 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 462 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-28 15:30:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-04-28 15:30:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 469. [2022-04-28 15:30:43,774 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:43,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 534 states. Second operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:43,775 INFO L74 IsIncluded]: Start isIncluded. First operand 534 states. Second operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:43,776 INFO L87 Difference]: Start difference. First operand 534 states. Second operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:43,788 INFO L93 Difference]: Finished difference Result 534 states and 786 transitions. [2022-04-28 15:30:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 786 transitions. [2022-04-28 15:30:43,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:43,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:43,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 534 states. [2022-04-28 15:30:43,790 INFO L87 Difference]: Start difference. First operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 534 states. [2022-04-28 15:30:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:43,804 INFO L93 Difference]: Finished difference Result 534 states and 786 transitions. [2022-04-28 15:30:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 786 transitions. [2022-04-28 15:30:43,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:43,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:43,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:43,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 464 states have (on average 1.4892241379310345) internal successors, (691), 464 states have internal predecessors, (691), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 695 transitions. [2022-04-28 15:30:43,832 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 695 transitions. Word has length 130 [2022-04-28 15:30:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:43,833 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 695 transitions. [2022-04-28 15:30:43,833 INFO L496 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-28 15:30:43,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 469 states and 695 transitions. [2022-04-28 15:30:44,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 695 edges. 695 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 695 transitions. [2022-04-28 15:30:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:30:44,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:44,552 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:44,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:30:44,552 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:44,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 1 times [2022-04-28 15:30:44,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [631217813] [2022-04-28 15:30:44,639 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:44,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:44,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1183688361, now seen corresponding path program 2 times [2022-04-28 15:30:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:44,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791289574] [2022-04-28 15:30:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:44,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {66342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {66335#true} is VALID [2022-04-28 15:30:44,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {66335#true} assume true; {66335#true} is VALID [2022-04-28 15:30:44,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66335#true} {66335#true} #689#return; {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {66335#true} call ULTIMATE.init(); {66342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {66342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {66335#true} assume true; {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66335#true} {66335#true} #689#return; {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {66335#true} call #t~ret161 := main(); {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {66335#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; {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {66335#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L272 TraceCheckUtils]: 7: Hoare triple {66335#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {66335#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); {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {66335#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; {66335#true} is VALID [2022-04-28 15:30:44,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {66335#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; {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {66335#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {66335#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {66335#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {66335#true} assume !false; {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {66335#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); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {66335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {66335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {66335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {66335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {66335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {66335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {66335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {66335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {66335#true} assume 8464 == #t~mem55;havoc #t~mem55; {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {66335#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; {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {66335#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {66335#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); {66335#true} is VALID [2022-04-28 15:30:44,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {66335#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); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {66335#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {66335#true} ~skip~0 := 0; {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {66335#true} assume !false; {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {66335#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); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {66335#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {66335#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {66335#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {66335#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {66335#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {66335#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {66335#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {66335#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 41: Hoare triple {66335#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 42: Hoare triple {66335#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {66335#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {66335#true} assume 8496 == #t~mem58;havoc #t~mem58; {66335#true} is VALID [2022-04-28 15:30:44,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {66335#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66335#true} is VALID [2022-04-28 15:30:44,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {66335#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66335#true} is VALID [2022-04-28 15:30:44,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {66335#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {66335#true} is VALID [2022-04-28 15:30:44,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {66335#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,807 INFO L290 TraceCheckUtils]: 51: Hoare triple {66340#(= 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; {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,807 INFO L290 TraceCheckUtils]: 52: Hoare triple {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,808 INFO L290 TraceCheckUtils]: 54: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,808 INFO L290 TraceCheckUtils]: 55: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,809 INFO L290 TraceCheckUtils]: 59: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,809 INFO L290 TraceCheckUtils]: 60: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {66340#(= 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); {66340#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 67: Hoare triple {66340#(= 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); {66341#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {66341#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {66336#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; {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {66336#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {66336#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {66336#false} ~skip~0 := 0; {66336#false} is VALID [2022-04-28 15:30:44,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {66336#false} assume !false; {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {66336#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {66336#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {66336#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {66336#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 81: Hoare triple {66336#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 82: Hoare triple {66336#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 83: Hoare triple {66336#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 84: Hoare triple {66336#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {66336#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 86: Hoare triple {66336#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 87: Hoare triple {66336#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 88: Hoare triple {66336#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 89: Hoare triple {66336#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 90: Hoare triple {66336#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {66336#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {66336#false} assume 8528 == #t~mem62;havoc #t~mem62; {66336#false} is VALID [2022-04-28 15:30:44,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 94: Hoare triple {66336#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; {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 95: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 96: Hoare triple {66336#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 97: Hoare triple {66336#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 98: Hoare triple {66336#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 99: Hoare triple {66336#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 100: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 101: Hoare triple {66336#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 102: Hoare triple {66336#false} ~skip~0 := 0; {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 103: Hoare triple {66336#false} assume !false; {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 104: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 105: Hoare triple {66336#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 106: Hoare triple {66336#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 107: Hoare triple {66336#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 108: Hoare triple {66336#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 109: Hoare triple {66336#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 110: Hoare triple {66336#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,814 INFO L290 TraceCheckUtils]: 111: Hoare triple {66336#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 112: Hoare triple {66336#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 113: Hoare triple {66336#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 114: Hoare triple {66336#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 115: Hoare triple {66336#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 116: Hoare triple {66336#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 117: Hoare triple {66336#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 118: Hoare triple {66336#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 119: Hoare triple {66336#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 120: Hoare triple {66336#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 121: Hoare triple {66336#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 122: Hoare triple {66336#false} assume 8544 == #t~mem64;havoc #t~mem64; {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 123: Hoare triple {66336#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 124: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 125: Hoare triple {66336#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 126: Hoare triple {66336#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); {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 127: Hoare triple {66336#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; {66336#false} is VALID [2022-04-28 15:30:44,815 INFO L290 TraceCheckUtils]: 128: Hoare triple {66336#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; {66336#false} is VALID [2022-04-28 15:30:44,816 INFO L290 TraceCheckUtils]: 129: Hoare triple {66336#false} assume 8 == ~blastFlag~0; {66336#false} is VALID [2022-04-28 15:30:44,816 INFO L290 TraceCheckUtils]: 130: Hoare triple {66336#false} assume !false; {66336#false} is VALID [2022-04-28 15:30:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-28 15:30:44,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:44,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791289574] [2022-04-28 15:30:44,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791289574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:44,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:44,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:44,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [631217813] [2022-04-28 15:30:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [631217813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:44,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638088871] [2022-04-28 15:30:44,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:30:44,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:44,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:44,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:44,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:44,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:44,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:44,901 INFO L87 Difference]: Start difference. First operand 469 states and 695 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:49,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:53,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:55,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:56,628 INFO L93 Difference]: Finished difference Result 985 states and 1463 transitions. [2022-04-28 15:30:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:30:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-28 15:30:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-28 15:30:56,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 514 transitions. [2022-04-28 15:30:56,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:56,953 INFO L225 Difference]: With dead ends: 985 [2022-04-28 15:30:56,953 INFO L226 Difference]: Without dead ends: 542 [2022-04-28 15:30:56,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:30:56,954 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 69 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:56,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 527 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:30:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-28 15:30:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 495. [2022-04-28 15:30:56,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:56,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,983 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,983 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:56,993 INFO L93 Difference]: Finished difference Result 542 states and 797 transitions. [2022-04-28 15:30:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 797 transitions. [2022-04-28 15:30:56,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:56,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:56,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 15:30:56,995 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 542 states. [2022-04-28 15:30:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:57,005 INFO L93 Difference]: Finished difference Result 542 states and 797 transitions. [2022-04-28 15:30:57,005 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 797 transitions. [2022-04-28 15:30:57,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:57,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:57,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:57,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.4857142857142858) internal successors, (728), 490 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 732 transitions. [2022-04-28 15:30:57,018 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 732 transitions. Word has length 131 [2022-04-28 15:30:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:57,018 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 732 transitions. [2022-04-28 15:30:57,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:57,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 732 transitions. [2022-04-28 15:30:57,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 732 edges. 732 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 732 transitions. [2022-04-28 15:30:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:30:57,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:57,706 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:30:57,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:30:57,706 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:57,707 INFO L85 PathProgramCache]: Analyzing trace with hash 913993068, now seen corresponding path program 1 times [2022-04-28 15:30:57,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:57,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [136998997] [2022-04-28 15:30:57,804 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:57,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 913993068, now seen corresponding path program 2 times [2022-04-28 15:30:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:57,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750535481] [2022-04-28 15:30:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:57,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:57,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {70398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {70391#true} is VALID [2022-04-28 15:30:57,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {70391#true} assume true; {70391#true} is VALID [2022-04-28 15:30:57,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70391#true} {70391#true} #689#return; {70391#true} is VALID [2022-04-28 15:30:57,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {70391#true} call ULTIMATE.init(); {70398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:30:57,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {70398#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {70391#true} is VALID [2022-04-28 15:30:57,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {70391#true} assume true; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70391#true} {70391#true} #689#return; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {70391#true} call #t~ret161 := main(); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {70391#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; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {70391#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L272 TraceCheckUtils]: 7: Hoare triple {70391#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {70391#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); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {70391#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; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {70391#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; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {70391#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {70391#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {70391#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {70391#true} assume !false; {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {70391#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); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {70391#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {70391#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {70391#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {70391#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {70391#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {70391#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {70391#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {70391#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {70391#true} assume 8464 == #t~mem55;havoc #t~mem55; {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {70391#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; {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {70391#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {70391#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); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {70391#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); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {70391#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 30: Hoare triple {70391#true} ~skip~0 := 0; {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {70391#true} assume !false; {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {70391#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); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {70391#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {70391#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {70391#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {70391#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {70391#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {70391#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {70391#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {70391#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {70391#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {70391#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {70391#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {70391#true} assume 8496 == #t~mem58;havoc #t~mem58; {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {70391#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 46: Hoare triple {70391#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70391#true} is VALID [2022-04-28 15:30:57,979 INFO L290 TraceCheckUtils]: 47: Hoare triple {70391#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {70391#true} is VALID [2022-04-28 15:30:57,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {70391#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {70396#(= 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; {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,985 INFO L290 TraceCheckUtils]: 64: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,987 INFO L290 TraceCheckUtils]: 68: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,987 INFO L290 TraceCheckUtils]: 69: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,987 INFO L290 TraceCheckUtils]: 70: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,988 INFO L290 TraceCheckUtils]: 71: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,988 INFO L290 TraceCheckUtils]: 72: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,988 INFO L290 TraceCheckUtils]: 73: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,989 INFO L290 TraceCheckUtils]: 74: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,989 INFO L290 TraceCheckUtils]: 75: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,990 INFO L290 TraceCheckUtils]: 77: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,990 INFO L290 TraceCheckUtils]: 78: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,990 INFO L290 TraceCheckUtils]: 79: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,991 INFO L290 TraceCheckUtils]: 80: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,991 INFO L290 TraceCheckUtils]: 81: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,991 INFO L290 TraceCheckUtils]: 82: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,992 INFO L290 TraceCheckUtils]: 83: Hoare triple {70396#(= 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); {70396#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:30:57,992 INFO L290 TraceCheckUtils]: 84: Hoare triple {70396#(= 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); {70397#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:30:57,992 INFO L290 TraceCheckUtils]: 85: Hoare triple {70397#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,992 INFO L290 TraceCheckUtils]: 86: Hoare triple {70392#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,992 INFO L290 TraceCheckUtils]: 87: Hoare triple {70392#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,992 INFO L290 TraceCheckUtils]: 88: Hoare triple {70392#false} assume 8673 == #t~mem80;havoc #t~mem80; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 89: Hoare triple {70392#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 90: Hoare triple {70392#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 91: Hoare triple {70392#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); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 92: Hoare triple {70392#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; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 93: Hoare triple {70392#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 94: Hoare triple {70392#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); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 95: Hoare triple {70392#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 96: Hoare triple {70392#false} ~skip~0 := 0; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 97: Hoare triple {70392#false} assume !false; {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 98: Hoare triple {70392#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); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 99: Hoare triple {70392#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 100: Hoare triple {70392#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 101: Hoare triple {70392#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 102: Hoare triple {70392#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 103: Hoare triple {70392#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 104: Hoare triple {70392#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,993 INFO L290 TraceCheckUtils]: 105: Hoare triple {70392#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 106: Hoare triple {70392#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 107: Hoare triple {70392#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 108: Hoare triple {70392#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 109: Hoare triple {70392#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 110: Hoare triple {70392#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 111: Hoare triple {70392#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 112: Hoare triple {70392#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 113: Hoare triple {70392#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 114: Hoare triple {70392#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 115: Hoare triple {70392#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {70392#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {70392#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 118: Hoare triple {70392#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 119: Hoare triple {70392#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 120: Hoare triple {70392#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 121: Hoare triple {70392#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 122: Hoare triple {70392#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,994 INFO L290 TraceCheckUtils]: 123: Hoare triple {70392#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 124: Hoare triple {70392#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 125: Hoare triple {70392#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 126: Hoare triple {70392#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 127: Hoare triple {70392#false} assume 8640 == #t~mem75;havoc #t~mem75; {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 128: Hoare triple {70392#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 129: Hoare triple {70392#false} assume 4 == ~blastFlag~0; {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L290 TraceCheckUtils]: 130: Hoare triple {70392#false} assume !false; {70392#false} is VALID [2022-04-28 15:30:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:30:57,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:57,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750535481] [2022-04-28 15:30:57,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750535481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:57,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:57,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:57,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:57,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [136998997] [2022-04-28 15:30:57,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [136998997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:57,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:57,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:57,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331140563] [2022-04-28 15:30:57,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:57,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:30:57,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:57,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:58,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:30:58,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:58,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:58,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:58,072 INFO L87 Difference]: Start difference. First operand 495 states and 732 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:30:59,417 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:03,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:07,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:08,476 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2022-04-28 15:31:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:31:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:31:08,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 15:31:08,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:08,837 INFO L225 Difference]: With dead ends: 1003 [2022-04-28 15:31:08,837 INFO L226 Difference]: Without dead ends: 534 [2022-04-28 15:31:08,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:08,838 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 40 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:08,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 533 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:31:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-04-28 15:31:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 512. [2022-04-28 15:31:08,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:08,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 534 states. Second operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,872 INFO L74 IsIncluded]: Start isIncluded. First operand 534 states. Second operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,873 INFO L87 Difference]: Start difference. First operand 534 states. Second operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:08,883 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2022-04-28 15:31:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2022-04-28 15:31:08,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:08,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:08,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 534 states. [2022-04-28 15:31:08,884 INFO L87 Difference]: Start difference. First operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 534 states. [2022-04-28 15:31:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:08,896 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2022-04-28 15:31:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2022-04-28 15:31:08,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:08,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:08,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:08,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 507 states have (on average 1.4832347140039448) internal successors, (752), 507 states have internal predecessors, (752), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 756 transitions. [2022-04-28 15:31:08,909 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 756 transitions. Word has length 131 [2022-04-28 15:31:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:08,910 INFO L495 AbstractCegarLoop]: Abstraction has 512 states and 756 transitions. [2022-04-28 15:31:08,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:08,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 512 states and 756 transitions. [2022-04-28 15:31:09,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 756 edges. 756 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 756 transitions. [2022-04-28 15:31:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:09,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:09,614 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:09,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:31:09,614 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:09,615 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 1 times [2022-04-28 15:31:09,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:09,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1631747562] [2022-04-28 15:31:09,703 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:09,703 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 141167833, now seen corresponding path program 2 times [2022-04-28 15:31:09,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:09,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448756438] [2022-04-28 15:31:09,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:09,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:09,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {74507#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {74501#true} is VALID [2022-04-28 15:31:09,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {74501#true} assume true; {74501#true} is VALID [2022-04-28 15:31:09,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74501#true} {74501#true} #689#return; {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {74501#true} call ULTIMATE.init(); {74507#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {74507#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {74501#true} assume true; {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74501#true} {74501#true} #689#return; {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {74501#true} call #t~ret161 := main(); {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {74501#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; {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {74501#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L272 TraceCheckUtils]: 7: Hoare triple {74501#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {74501#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); {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {74501#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; {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {74501#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; {74501#true} is VALID [2022-04-28 15:31:09,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {74501#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {74501#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {74501#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {74501#true} assume !false; {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {74501#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); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {74501#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {74501#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {74501#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {74501#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {74501#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {74501#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {74501#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {74501#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {74501#true} assume 8464 == #t~mem55;havoc #t~mem55; {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {74501#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; {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {74501#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74501#true} is VALID [2022-04-28 15:31:09,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {74501#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); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {74501#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); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {74501#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {74501#true} ~skip~0 := 0; {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {74501#true} assume !false; {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {74501#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); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {74501#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {74501#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {74501#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {74501#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {74501#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {74501#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {74501#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {74501#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {74501#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {74501#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {74501#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {74501#true} assume 8496 == #t~mem58;havoc #t~mem58; {74501#true} is VALID [2022-04-28 15:31:09,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {74501#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74501#true} is VALID [2022-04-28 15:31:09,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {74501#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,857 INFO L290 TraceCheckUtils]: 48: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,860 INFO L290 TraceCheckUtils]: 60: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,862 INFO L290 TraceCheckUtils]: 66: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,862 INFO L290 TraceCheckUtils]: 67: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,862 INFO L290 TraceCheckUtils]: 68: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,862 INFO L290 TraceCheckUtils]: 69: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,863 INFO L290 TraceCheckUtils]: 70: Hoare triple {74506#(= 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; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,863 INFO L290 TraceCheckUtils]: 71: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,863 INFO L290 TraceCheckUtils]: 72: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,863 INFO L290 TraceCheckUtils]: 73: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,864 INFO L290 TraceCheckUtils]: 74: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,864 INFO L290 TraceCheckUtils]: 75: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,866 INFO L290 TraceCheckUtils]: 82: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,866 INFO L290 TraceCheckUtils]: 83: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,866 INFO L290 TraceCheckUtils]: 84: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,867 INFO L290 TraceCheckUtils]: 87: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,867 INFO L290 TraceCheckUtils]: 88: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,867 INFO L290 TraceCheckUtils]: 89: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,867 INFO L290 TraceCheckUtils]: 90: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,868 INFO L290 TraceCheckUtils]: 91: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,868 INFO L290 TraceCheckUtils]: 92: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,868 INFO L290 TraceCheckUtils]: 93: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,868 INFO L290 TraceCheckUtils]: 94: Hoare triple {74506#(= 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; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,869 INFO L290 TraceCheckUtils]: 95: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,869 INFO L290 TraceCheckUtils]: 96: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,869 INFO L290 TraceCheckUtils]: 97: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,869 INFO L290 TraceCheckUtils]: 98: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,870 INFO L290 TraceCheckUtils]: 99: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,870 INFO L290 TraceCheckUtils]: 100: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,870 INFO L290 TraceCheckUtils]: 101: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,870 INFO L290 TraceCheckUtils]: 102: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,871 INFO L290 TraceCheckUtils]: 103: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,871 INFO L290 TraceCheckUtils]: 104: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,871 INFO L290 TraceCheckUtils]: 105: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,871 INFO L290 TraceCheckUtils]: 106: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,872 INFO L290 TraceCheckUtils]: 107: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,872 INFO L290 TraceCheckUtils]: 108: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,872 INFO L290 TraceCheckUtils]: 109: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,872 INFO L290 TraceCheckUtils]: 110: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,873 INFO L290 TraceCheckUtils]: 111: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,873 INFO L290 TraceCheckUtils]: 113: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,873 INFO L290 TraceCheckUtils]: 114: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,874 INFO L290 TraceCheckUtils]: 115: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,874 INFO L290 TraceCheckUtils]: 116: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,874 INFO L290 TraceCheckUtils]: 117: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,875 INFO L290 TraceCheckUtils]: 120: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,875 INFO L290 TraceCheckUtils]: 121: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,875 INFO L290 TraceCheckUtils]: 122: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,875 INFO L290 TraceCheckUtils]: 123: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,876 INFO L290 TraceCheckUtils]: 124: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,876 INFO L290 TraceCheckUtils]: 125: Hoare triple {74506#(= 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; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,876 INFO L290 TraceCheckUtils]: 126: Hoare triple {74506#(= 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); {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,876 INFO L290 TraceCheckUtils]: 127: Hoare triple {74506#(= 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; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,877 INFO L290 TraceCheckUtils]: 128: Hoare triple {74506#(= 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; {74506#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:31:09,877 INFO L290 TraceCheckUtils]: 129: Hoare triple {74506#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {74502#false} is VALID [2022-04-28 15:31:09,877 INFO L290 TraceCheckUtils]: 130: Hoare triple {74502#false} assume !false; {74502#false} is VALID [2022-04-28 15:31:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-28 15:31:09,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:09,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448756438] [2022-04-28 15:31:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448756438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:09,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:09,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:09,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1631747562] [2022-04-28 15:31:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1631747562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:09,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215496543] [2022-04-28 15:31:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:09,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:09,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:09,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:09,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:09,950 INFO L87 Difference]: Start difference. First operand 512 states and 756 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:12,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:16,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:17,501 INFO L93 Difference]: Finished difference Result 1439 states and 2145 transitions. [2022-04-28 15:31:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-28 15:31:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-28 15:31:17,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-28 15:31:17,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:17,909 INFO L225 Difference]: With dead ends: 1439 [2022-04-28 15:31:17,909 INFO L226 Difference]: Without dead ends: 953 [2022-04-28 15:31:17,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:17,910 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:17,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 443 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 291 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:31:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-04-28 15:31:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2022-04-28 15:31:17,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:17,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 953 states, 948 states have (on average 1.4820675105485233) internal successors, (1405), 948 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:17,973 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 953 states, 948 states have (on average 1.4820675105485233) internal successors, (1405), 948 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:17,973 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 953 states, 948 states have (on average 1.4820675105485233) internal successors, (1405), 948 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:18,002 INFO L93 Difference]: Finished difference Result 953 states and 1409 transitions. [2022-04-28 15:31:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1409 transitions. [2022-04-28 15:31:18,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:18,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:18,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 953 states, 948 states have (on average 1.4820675105485233) internal successors, (1405), 948 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 953 states. [2022-04-28 15:31:18,004 INFO L87 Difference]: Start difference. First operand has 953 states, 948 states have (on average 1.4820675105485233) internal successors, (1405), 948 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 953 states. [2022-04-28 15:31:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:18,032 INFO L93 Difference]: Finished difference Result 953 states and 1409 transitions. [2022-04-28 15:31:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1409 transitions. [2022-04-28 15:31:18,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:18,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:18,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:18,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 948 states have (on average 1.4820675105485233) internal successors, (1405), 948 states have internal predecessors, (1405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1409 transitions. [2022-04-28 15:31:18,074 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1409 transitions. Word has length 131 [2022-04-28 15:31:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:18,074 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1409 transitions. [2022-04-28 15:31:18,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:18,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 953 states and 1409 transitions. [2022-04-28 15:31:19,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1409 edges. 1409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1409 transitions. [2022-04-28 15:31:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:19,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:19,404 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:19,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:31:19,404 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 1 times [2022-04-28 15:31:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:19,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602041658] [2022-04-28 15:31:19,495 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:19,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2017650651, now seen corresponding path program 2 times [2022-04-28 15:31:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:19,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424437734] [2022-04-28 15:31:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:19,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {81206#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {81200#true} is VALID [2022-04-28 15:31:19,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {81200#true} assume true; {81200#true} is VALID [2022-04-28 15:31:19,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81200#true} {81200#true} #689#return; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {81200#true} call ULTIMATE.init(); {81206#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {81206#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {81200#true} assume true; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81200#true} {81200#true} #689#return; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {81200#true} call #t~ret161 := main(); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {81200#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; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {81200#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L272 TraceCheckUtils]: 7: Hoare triple {81200#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {81200#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); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {81200#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; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {81200#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; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {81200#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {81200#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {81200#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81200#true} is VALID [2022-04-28 15:31:19,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {81200#true} assume !false; {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {81200#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); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {81200#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {81200#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {81200#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {81200#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {81200#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {81200#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {81200#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {81200#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {81200#true} assume 8464 == #t~mem55;havoc #t~mem55; {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {81200#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; {81200#true} is VALID [2022-04-28 15:31:19,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {81200#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {81205#(= 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); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {81205#(= 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); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !false; {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {81205#(= 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); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81205#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 46: Hoare triple {81205#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 47: Hoare triple {81201#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {81201#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {81201#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {81201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {81201#false} ~skip~0 := 0; {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 53: Hoare triple {81201#false} assume !false; {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {81201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {81201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 57: Hoare triple {81201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {81201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,603 INFO L290 TraceCheckUtils]: 59: Hoare triple {81201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 60: Hoare triple {81201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {81201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {81201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {81201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {81201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {81201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {81201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 67: Hoare triple {81201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 68: Hoare triple {81201#false} assume 8512 == #t~mem60;havoc #t~mem60; {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 69: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 70: Hoare triple {81201#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; {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 71: Hoare triple {81201#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 72: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 73: Hoare triple {81201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 74: Hoare triple {81201#false} ~skip~0 := 0; {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 75: Hoare triple {81201#false} assume !false; {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 76: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,604 INFO L290 TraceCheckUtils]: 77: Hoare triple {81201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 78: Hoare triple {81201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {81201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 80: Hoare triple {81201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 81: Hoare triple {81201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 82: Hoare triple {81201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {81201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {81201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 85: Hoare triple {81201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 86: Hoare triple {81201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {81201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 88: Hoare triple {81201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {81201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 90: Hoare triple {81201#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {81201#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 92: Hoare triple {81201#false} assume 8528 == #t~mem62;havoc #t~mem62; {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 93: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,605 INFO L290 TraceCheckUtils]: 94: Hoare triple {81201#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; {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {81201#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 97: Hoare triple {81201#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 98: Hoare triple {81201#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 99: Hoare triple {81201#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 100: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 101: Hoare triple {81201#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 102: Hoare triple {81201#false} ~skip~0 := 0; {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 103: Hoare triple {81201#false} assume !false; {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 104: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 105: Hoare triple {81201#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 106: Hoare triple {81201#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 107: Hoare triple {81201#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 108: Hoare triple {81201#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 109: Hoare triple {81201#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 110: Hoare triple {81201#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 111: Hoare triple {81201#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 112: Hoare triple {81201#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,606 INFO L290 TraceCheckUtils]: 113: Hoare triple {81201#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 114: Hoare triple {81201#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 115: Hoare triple {81201#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 116: Hoare triple {81201#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 117: Hoare triple {81201#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 118: Hoare triple {81201#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 119: Hoare triple {81201#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 120: Hoare triple {81201#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 121: Hoare triple {81201#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 122: Hoare triple {81201#false} assume 8544 == #t~mem64;havoc #t~mem64; {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 123: Hoare triple {81201#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 124: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 125: Hoare triple {81201#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 126: Hoare triple {81201#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); {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 127: Hoare triple {81201#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; {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 128: Hoare triple {81201#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; {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 129: Hoare triple {81201#false} assume 8 == ~blastFlag~0; {81201#false} is VALID [2022-04-28 15:31:19,607 INFO L290 TraceCheckUtils]: 130: Hoare triple {81201#false} assume !false; {81201#false} is VALID [2022-04-28 15:31:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-04-28 15:31:19,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424437734] [2022-04-28 15:31:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424437734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:19,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:19,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:19,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602041658] [2022-04-28 15:31:19,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602041658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:19,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:19,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69928415] [2022-04-28 15:31:19,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:19,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:19,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:19,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:19,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:19,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:19,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:19,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:19,670 INFO L87 Difference]: Start difference. First operand 953 states and 1409 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:26,385 INFO L93 Difference]: Finished difference Result 1907 states and 2825 transitions. [2022-04-28 15:31:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:26,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:31:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:31:26,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-28 15:31:26,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:26,715 INFO L225 Difference]: With dead ends: 1907 [2022-04-28 15:31:26,716 INFO L226 Difference]: Without dead ends: 980 [2022-04-28 15:31:26,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:26,717 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:26,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 15:31:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2022-04-28 15:31:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2022-04-28 15:31:26,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:26,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 980 states. Second operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,774 INFO L74 IsIncluded]: Start isIncluded. First operand 980 states. Second operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,774 INFO L87 Difference]: Start difference. First operand 980 states. Second operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:26,802 INFO L93 Difference]: Finished difference Result 980 states and 1444 transitions. [2022-04-28 15:31:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:31:26,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:26,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:26,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 980 states. [2022-04-28 15:31:26,805 INFO L87 Difference]: Start difference. First operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 980 states. [2022-04-28 15:31:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:26,834 INFO L93 Difference]: Finished difference Result 980 states and 1444 transitions. [2022-04-28 15:31:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:31:26,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:26,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:26,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:26,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 975 states have (on average 1.476923076923077) internal successors, (1440), 975 states have internal predecessors, (1440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1444 transitions. [2022-04-28 15:31:26,886 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1444 transitions. Word has length 131 [2022-04-28 15:31:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:26,886 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1444 transitions. [2022-04-28 15:31:26,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:26,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 980 states and 1444 transitions. [2022-04-28 15:31:28,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1444 edges. 1444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1444 transitions. [2022-04-28 15:31:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:31:28,257 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:28,258 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:28,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:31:28,258 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 1 times [2022-04-28 15:31:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:28,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1799283194] [2022-04-28 15:31:28,344 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:28,344 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2136092125, now seen corresponding path program 2 times [2022-04-28 15:31:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:28,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379616224] [2022-04-28 15:31:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:28,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:28,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {88949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {88943#true} assume true; {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88943#true} {88943#true} #689#return; {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {88943#true} call ULTIMATE.init(); {88949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:31:28,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {88949#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {88943#true} assume true; {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88943#true} {88943#true} #689#return; {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {88943#true} call #t~ret161 := main(); {88943#true} is VALID [2022-04-28 15:31:28,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {88943#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; {88943#true} is VALID [2022-04-28 15:31:28,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {88943#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {88943#true} is VALID [2022-04-28 15:31:28,466 INFO L272 TraceCheckUtils]: 7: Hoare triple {88943#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88943#true} is VALID [2022-04-28 15:31:28,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {88943#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); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {88948#(= 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; {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {88948#(= 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; {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {88948#(= 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)))); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !false; {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {88948#(= 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); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {88948#(= 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; {88948#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {88948#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {88944#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {88944#false} ~skip~0 := 0; {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {88944#false} assume !false; {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {88944#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {88944#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,470 INFO L290 TraceCheckUtils]: 35: Hoare triple {88944#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {88944#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {88944#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {88944#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {88944#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {88944#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {88944#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 42: Hoare triple {88944#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {88944#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {88944#false} assume 8496 == #t~mem58;havoc #t~mem58; {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {88944#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {88944#false} assume !(1 == ~blastFlag~0); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 47: Hoare triple {88944#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 48: Hoare triple {88944#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 49: Hoare triple {88944#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 50: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 51: Hoare triple {88944#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {88944#false} ~skip~0 := 0; {88944#false} is VALID [2022-04-28 15:31:28,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {88944#false} assume !false; {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 54: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 55: Hoare triple {88944#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 56: Hoare triple {88944#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {88944#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {88944#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {88944#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {88944#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {88944#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {88944#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {88944#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {88944#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 65: Hoare triple {88944#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {88944#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {88944#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 68: Hoare triple {88944#false} assume 8512 == #t~mem60;havoc #t~mem60; {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 69: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 70: Hoare triple {88944#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; {88944#false} is VALID [2022-04-28 15:31:28,472 INFO L290 TraceCheckUtils]: 71: Hoare triple {88944#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 72: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 73: Hoare triple {88944#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 74: Hoare triple {88944#false} ~skip~0 := 0; {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 75: Hoare triple {88944#false} assume !false; {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 76: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 77: Hoare triple {88944#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 78: Hoare triple {88944#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 79: Hoare triple {88944#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 80: Hoare triple {88944#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 81: Hoare triple {88944#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 82: Hoare triple {88944#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {88944#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {88944#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {88944#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 86: Hoare triple {88944#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 87: Hoare triple {88944#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 88: Hoare triple {88944#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,473 INFO L290 TraceCheckUtils]: 89: Hoare triple {88944#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 90: Hoare triple {88944#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 91: Hoare triple {88944#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 92: Hoare triple {88944#false} assume 8528 == #t~mem62;havoc #t~mem62; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 93: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 94: Hoare triple {88944#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; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 95: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 96: Hoare triple {88944#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 97: Hoare triple {88944#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 98: Hoare triple {88944#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 99: Hoare triple {88944#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 100: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 101: Hoare triple {88944#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 102: Hoare triple {88944#false} ~skip~0 := 0; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 103: Hoare triple {88944#false} assume !false; {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {88944#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {88944#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,474 INFO L290 TraceCheckUtils]: 107: Hoare triple {88944#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {88944#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 109: Hoare triple {88944#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 110: Hoare triple {88944#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {88944#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 112: Hoare triple {88944#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 113: Hoare triple {88944#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 114: Hoare triple {88944#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 115: Hoare triple {88944#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 116: Hoare triple {88944#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 117: Hoare triple {88944#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 118: Hoare triple {88944#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 119: Hoare triple {88944#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 120: Hoare triple {88944#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 121: Hoare triple {88944#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 122: Hoare triple {88944#false} assume 8544 == #t~mem64;havoc #t~mem64; {88944#false} is VALID [2022-04-28 15:31:28,475 INFO L290 TraceCheckUtils]: 123: Hoare triple {88944#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 124: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 125: Hoare triple {88944#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 126: Hoare triple {88944#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); {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 127: Hoare triple {88944#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; {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 128: Hoare triple {88944#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; {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 129: Hoare triple {88944#false} assume 8 == ~blastFlag~0; {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L290 TraceCheckUtils]: 130: Hoare triple {88944#false} assume !false; {88944#false} is VALID [2022-04-28 15:31:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-04-28 15:31:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379616224] [2022-04-28 15:31:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379616224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:28,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:28,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1799283194] [2022-04-28 15:31:28,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1799283194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:28,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:28,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598153676] [2022-04-28 15:31:28,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:28,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:28,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:28,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:28,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:28,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:28,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:28,530 INFO L87 Difference]: Start difference. First operand 980 states and 1444 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:30,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:33,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:35,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:36,261 INFO L93 Difference]: Finished difference Result 1936 states and 2861 transitions. [2022-04-28 15:31:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:36,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-28 15:31:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:31:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:31:36,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-28 15:31:36,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 425 edges. 425 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:36,555 INFO L225 Difference]: With dead ends: 1936 [2022-04-28 15:31:36,555 INFO L226 Difference]: Without dead ends: 982 [2022-04-28 15:31:36,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:36,556 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:36,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 15:31:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-28 15:31:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-04-28 15:31:36,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:36,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4759467758444218) internal successors, (1442), 977 states have internal predecessors, (1442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,621 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4759467758444218) internal successors, (1442), 977 states have internal predecessors, (1442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,622 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4759467758444218) internal successors, (1442), 977 states have internal predecessors, (1442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:36,652 INFO L93 Difference]: Finished difference Result 982 states and 1446 transitions. [2022-04-28 15:31:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1446 transitions. [2022-04-28 15:31:36,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:36,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:36,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 982 states, 977 states have (on average 1.4759467758444218) internal successors, (1442), 977 states have internal predecessors, (1442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-28 15:31:36,656 INFO L87 Difference]: Start difference. First operand has 982 states, 977 states have (on average 1.4759467758444218) internal successors, (1442), 977 states have internal predecessors, (1442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-28 15:31:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:36,693 INFO L93 Difference]: Finished difference Result 982 states and 1446 transitions. [2022-04-28 15:31:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1446 transitions. [2022-04-28 15:31:36,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:36,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:36,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:36,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 977 states have (on average 1.4759467758444218) internal successors, (1442), 977 states have internal predecessors, (1442), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1446 transitions. [2022-04-28 15:31:36,740 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1446 transitions. Word has length 131 [2022-04-28 15:31:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:36,740 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1446 transitions. [2022-04-28 15:31:36,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:36,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 982 states and 1446 transitions. [2022-04-28 15:31:38,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1446 edges. 1446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:38,081 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1446 transitions. [2022-04-28 15:31:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:31:38,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:38,082 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:38,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:31:38,082 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:38,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 1 times [2022-04-28 15:31:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:38,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393660393] [2022-04-28 15:31:38,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:38,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -997450557, now seen corresponding path program 2 times [2022-04-28 15:31:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073907803] [2022-04-28 15:31:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:38,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:38,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {96758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {96752#true} is VALID [2022-04-28 15:31:38,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {96752#true} assume true; {96752#true} is VALID [2022-04-28 15:31:38,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96752#true} {96752#true} #689#return; {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {96752#true} call ULTIMATE.init(); {96758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:31:38,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {96758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {96752#true} assume true; {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96752#true} {96752#true} #689#return; {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {96752#true} call #t~ret161 := main(); {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {96752#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; {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {96752#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {96752#true} is VALID [2022-04-28 15:31:38,301 INFO L272 TraceCheckUtils]: 7: Hoare triple {96752#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {96752#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; {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {96752#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; {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {96752#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {96752#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {96752#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {96752#true} assume !false; {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {96752#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {96752#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {96752#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {96752#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {96752#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {96752#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {96752#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {96752#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {96752#true} assume 8464 == #t~mem55;havoc #t~mem55; {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {96752#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; {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {96752#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {96752#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {96752#true} ~skip~0 := 0; {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {96752#true} assume !false; {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {96752#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {96752#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {96752#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {96752#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {96752#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {96752#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {96752#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {96752#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {96752#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {96752#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {96752#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {96752#true} assume 8496 == #t~mem58;havoc #t~mem58; {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {96752#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {96752#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {96752#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {96752#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {96752#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {96752#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {96752#true} ~skip~0 := 0; {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {96752#true} assume !false; {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {96752#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 56: Hoare triple {96752#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {96752#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {96752#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 59: Hoare triple {96752#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,304 INFO L290 TraceCheckUtils]: 60: Hoare triple {96752#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {96752#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 62: Hoare triple {96752#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 63: Hoare triple {96752#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {96752#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {96752#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 66: Hoare triple {96752#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 67: Hoare triple {96752#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 68: Hoare triple {96752#true} assume 8512 == #t~mem60;havoc #t~mem60; {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 69: Hoare triple {96752#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); {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 70: Hoare triple {96752#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; {96752#true} is VALID [2022-04-28 15:31:38,305 INFO L290 TraceCheckUtils]: 71: Hoare triple {96752#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,306 INFO L290 TraceCheckUtils]: 74: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,306 INFO L290 TraceCheckUtils]: 75: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,307 INFO L290 TraceCheckUtils]: 76: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,307 INFO L290 TraceCheckUtils]: 77: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,307 INFO L290 TraceCheckUtils]: 78: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,307 INFO L290 TraceCheckUtils]: 79: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,308 INFO L290 TraceCheckUtils]: 80: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,308 INFO L290 TraceCheckUtils]: 81: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,308 INFO L290 TraceCheckUtils]: 82: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,308 INFO L290 TraceCheckUtils]: 83: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,309 INFO L290 TraceCheckUtils]: 84: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,309 INFO L290 TraceCheckUtils]: 86: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,309 INFO L290 TraceCheckUtils]: 87: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,310 INFO L290 TraceCheckUtils]: 88: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,310 INFO L290 TraceCheckUtils]: 89: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,310 INFO L290 TraceCheckUtils]: 90: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,310 INFO L290 TraceCheckUtils]: 91: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,311 INFO L290 TraceCheckUtils]: 92: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,311 INFO L290 TraceCheckUtils]: 93: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,311 INFO L290 TraceCheckUtils]: 94: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,311 INFO L290 TraceCheckUtils]: 95: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,312 INFO L290 TraceCheckUtils]: 96: Hoare triple {96757#(<= 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; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,312 INFO L290 TraceCheckUtils]: 97: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,312 INFO L290 TraceCheckUtils]: 98: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,312 INFO L290 TraceCheckUtils]: 99: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,312 INFO L290 TraceCheckUtils]: 100: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,313 INFO L290 TraceCheckUtils]: 101: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,313 INFO L290 TraceCheckUtils]: 102: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,313 INFO L290 TraceCheckUtils]: 103: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,313 INFO L290 TraceCheckUtils]: 104: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,314 INFO L290 TraceCheckUtils]: 105: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,314 INFO L290 TraceCheckUtils]: 106: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,314 INFO L290 TraceCheckUtils]: 107: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,314 INFO L290 TraceCheckUtils]: 108: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,315 INFO L290 TraceCheckUtils]: 109: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,315 INFO L290 TraceCheckUtils]: 110: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,315 INFO L290 TraceCheckUtils]: 111: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,315 INFO L290 TraceCheckUtils]: 112: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,316 INFO L290 TraceCheckUtils]: 113: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,316 INFO L290 TraceCheckUtils]: 114: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,316 INFO L290 TraceCheckUtils]: 115: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,316 INFO L290 TraceCheckUtils]: 116: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,317 INFO L290 TraceCheckUtils]: 117: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,317 INFO L290 TraceCheckUtils]: 118: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,317 INFO L290 TraceCheckUtils]: 119: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,317 INFO L290 TraceCheckUtils]: 120: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,317 INFO L290 TraceCheckUtils]: 121: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,318 INFO L290 TraceCheckUtils]: 122: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,318 INFO L290 TraceCheckUtils]: 123: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,318 INFO L290 TraceCheckUtils]: 124: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,318 INFO L290 TraceCheckUtils]: 125: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,319 INFO L290 TraceCheckUtils]: 126: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,319 INFO L290 TraceCheckUtils]: 127: Hoare triple {96757#(<= 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; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,319 INFO L290 TraceCheckUtils]: 128: Hoare triple {96757#(<= 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); {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,319 INFO L290 TraceCheckUtils]: 129: Hoare triple {96757#(<= 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; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,320 INFO L290 TraceCheckUtils]: 130: Hoare triple {96757#(<= 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; {96757#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:31:38,320 INFO L290 TraceCheckUtils]: 131: Hoare triple {96757#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {96753#false} is VALID [2022-04-28 15:31:38,320 INFO L290 TraceCheckUtils]: 132: Hoare triple {96753#false} assume !false; {96753#false} is VALID [2022-04-28 15:31:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 15:31:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073907803] [2022-04-28 15:31:38,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073907803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:38,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:38,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:38,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:38,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393660393] [2022-04-28 15:31:38,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393660393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:38,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:38,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:38,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059509100] [2022-04-28 15:31:38,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 15:31:38,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:38,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:38,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:38,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:38,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:38,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:38,383 INFO L87 Difference]: Start difference. First operand 982 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:40,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:43,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:45,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:47,362 INFO L93 Difference]: Finished difference Result 2422 states and 3586 transitions. [2022-04-28 15:31:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:47,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 15:31:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:31:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:31:47,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-28 15:31:47,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:47,829 INFO L225 Difference]: With dead ends: 2422 [2022-04-28 15:31:47,829 INFO L226 Difference]: Without dead ends: 1468 [2022-04-28 15:31:47,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:47,831 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s 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, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:47,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-04-28 15:31:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2022-04-28 15:31:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1466. [2022-04-28 15:31:48,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:48,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1468 states. Second operand has 1466 states, 1461 states have (on average 1.48186173853525) internal successors, (2165), 1461 states have internal predecessors, (2165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:48,319 INFO L74 IsIncluded]: Start isIncluded. First operand 1468 states. Second operand has 1466 states, 1461 states have (on average 1.48186173853525) internal successors, (2165), 1461 states have internal predecessors, (2165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:48,320 INFO L87 Difference]: Start difference. First operand 1468 states. Second operand has 1466 states, 1461 states have (on average 1.48186173853525) internal successors, (2165), 1461 states have internal predecessors, (2165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:48,377 INFO L93 Difference]: Finished difference Result 1468 states and 2170 transitions. [2022-04-28 15:31:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2170 transitions. [2022-04-28 15:31:48,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:48,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:48,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 1466 states, 1461 states have (on average 1.48186173853525) internal successors, (2165), 1461 states have internal predecessors, (2165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1468 states. [2022-04-28 15:31:48,381 INFO L87 Difference]: Start difference. First operand has 1466 states, 1461 states have (on average 1.48186173853525) internal successors, (2165), 1461 states have internal predecessors, (2165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1468 states. [2022-04-28 15:31:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:48,445 INFO L93 Difference]: Finished difference Result 1468 states and 2170 transitions. [2022-04-28 15:31:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2170 transitions. [2022-04-28 15:31:48,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:48,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:48,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:48,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1461 states have (on average 1.48186173853525) internal successors, (2165), 1461 states have internal predecessors, (2165), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 2169 transitions. [2022-04-28 15:31:48,538 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 2169 transitions. Word has length 133 [2022-04-28 15:31:48,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:48,538 INFO L495 AbstractCegarLoop]: Abstraction has 1466 states and 2169 transitions. [2022-04-28 15:31:48,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:31:48,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1466 states and 2169 transitions. [2022-04-28 15:31:50,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2169 edges. 2169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 2169 transitions. [2022-04-28 15:31:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 15:31:50,629 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:50,630 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:31:50,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:31:50,630 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 1 times [2022-04-28 15:31:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:50,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [952148430] [2022-04-28 15:31:50,713 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:50,713 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:50,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1473303164, now seen corresponding path program 2 times [2022-04-28 15:31:50,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:50,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814687610] [2022-04-28 15:31:50,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:50,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {107479#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {107473#true} is VALID [2022-04-28 15:31:50,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {107473#true} assume true; {107473#true} is VALID [2022-04-28 15:31:50,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107473#true} {107473#true} #689#return; {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {107473#true} call ULTIMATE.init(); {107479#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:31:50,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {107479#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {107473#true} assume true; {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107473#true} {107473#true} #689#return; {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {107473#true} call #t~ret161 := main(); {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {107473#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; {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {107473#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L272 TraceCheckUtils]: 7: Hoare triple {107473#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107473#true} is VALID [2022-04-28 15:31:50,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {107473#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; {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {107473#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; {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {107473#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {107473#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {107473#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {107473#true} assume !false; {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {107473#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {107473#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {107473#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {107473#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {107473#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {107473#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {107473#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {107473#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {107473#true} assume 8464 == #t~mem55;havoc #t~mem55; {107473#true} is VALID [2022-04-28 15:31:50,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {107473#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; {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {107473#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {107473#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {107473#true} ~skip~0 := 0; {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {107473#true} assume !false; {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {107473#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {107473#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {107473#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {107473#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {107473#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {107473#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {107473#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {107473#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {107473#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {107473#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {107473#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {107473#true} assume 8496 == #t~mem58;havoc #t~mem58; {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {107473#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {107473#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {107473#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {107473#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {107473#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 50: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {107473#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {107473#true} ~skip~0 := 0; {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {107473#true} assume !false; {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 54: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {107473#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {107473#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {107473#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {107473#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {107473#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {107473#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {107473#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 62: Hoare triple {107473#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 63: Hoare triple {107473#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {107473#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {107473#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 66: Hoare triple {107473#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 67: Hoare triple {107473#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {107473#true} assume 8512 == #t~mem60;havoc #t~mem60; {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 70: Hoare triple {107473#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; {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 71: Hoare triple {107473#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 72: Hoare triple {107473#true} assume !(~ret~0 <= 0); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 73: Hoare triple {107473#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 75: Hoare triple {107473#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107473#true} is VALID [2022-04-28 15:31:50,855 INFO L290 TraceCheckUtils]: 76: Hoare triple {107473#true} ~skip~0 := 0; {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 77: Hoare triple {107473#true} assume !false; {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 78: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 79: Hoare triple {107473#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 80: Hoare triple {107473#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 81: Hoare triple {107473#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 82: Hoare triple {107473#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 83: Hoare triple {107473#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 84: Hoare triple {107473#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 85: Hoare triple {107473#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 86: Hoare triple {107473#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 87: Hoare triple {107473#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {107473#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {107473#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {107473#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 91: Hoare triple {107473#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 92: Hoare triple {107473#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 93: Hoare triple {107473#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107473#true} is VALID [2022-04-28 15:31:50,856 INFO L290 TraceCheckUtils]: 94: Hoare triple {107473#true} assume 8528 == #t~mem62;havoc #t~mem62; {107473#true} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 95: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 96: Hoare triple {107473#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; {107473#true} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 97: Hoare triple {107473#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); {107473#true} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 98: Hoare triple {107473#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {107473#true} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 99: Hoare triple {107473#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {107473#true} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 100: Hoare triple {107473#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,857 INFO L290 TraceCheckUtils]: 101: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {107478#(<= 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); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,858 INFO L290 TraceCheckUtils]: 103: Hoare triple {107478#(<= 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); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,858 INFO L290 TraceCheckUtils]: 104: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,858 INFO L290 TraceCheckUtils]: 105: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,859 INFO L290 TraceCheckUtils]: 106: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,859 INFO L290 TraceCheckUtils]: 107: Hoare triple {107478#(<= 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); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,859 INFO L290 TraceCheckUtils]: 108: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,859 INFO L290 TraceCheckUtils]: 109: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,859 INFO L290 TraceCheckUtils]: 110: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,860 INFO L290 TraceCheckUtils]: 111: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,860 INFO L290 TraceCheckUtils]: 112: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,860 INFO L290 TraceCheckUtils]: 113: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,860 INFO L290 TraceCheckUtils]: 114: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,861 INFO L290 TraceCheckUtils]: 115: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,861 INFO L290 TraceCheckUtils]: 116: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,861 INFO L290 TraceCheckUtils]: 117: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,861 INFO L290 TraceCheckUtils]: 118: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,861 INFO L290 TraceCheckUtils]: 119: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,862 INFO L290 TraceCheckUtils]: 120: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,862 INFO L290 TraceCheckUtils]: 121: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,862 INFO L290 TraceCheckUtils]: 122: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,862 INFO L290 TraceCheckUtils]: 123: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,863 INFO L290 TraceCheckUtils]: 124: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,863 INFO L290 TraceCheckUtils]: 125: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,863 INFO L290 TraceCheckUtils]: 126: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,863 INFO L290 TraceCheckUtils]: 127: Hoare triple {107478#(<= 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); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,864 INFO L290 TraceCheckUtils]: 128: Hoare triple {107478#(<= 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; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,864 INFO L290 TraceCheckUtils]: 129: Hoare triple {107478#(<= 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); {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,864 INFO L290 TraceCheckUtils]: 130: Hoare triple {107478#(<= 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; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,864 INFO L290 TraceCheckUtils]: 131: Hoare triple {107478#(<= 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; {107478#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:31:50,864 INFO L290 TraceCheckUtils]: 132: Hoare triple {107478#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {107474#false} is VALID [2022-04-28 15:31:50,865 INFO L290 TraceCheckUtils]: 133: Hoare triple {107474#false} assume !false; {107474#false} is VALID [2022-04-28 15:31:50,865 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-28 15:31:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:50,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814687610] [2022-04-28 15:31:50,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814687610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:50,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:50,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:50,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:50,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [952148430] [2022-04-28 15:31:50,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [952148430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:50,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:31:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281063735] [2022-04-28 15:31:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:50,866 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-28 15:31:50,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:50,866 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-28 15:31:50,927 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-28 15:31:50,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:31:50,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:50,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:31:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:50,928 INFO L87 Difference]: Start difference. First operand 1466 states and 2169 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-28 15:31:55,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:59,538 INFO L93 Difference]: Finished difference Result 1954 states and 2896 transitions. [2022-04-28 15:31:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:31:59,538 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-28 15:31:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:59,538 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-28 15:31:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:31:59,540 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-28 15:31:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:31:59,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-28 15:31:59,801 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-28 15:31:59,963 INFO L225 Difference]: With dead ends: 1954 [2022-04-28 15:31:59,964 INFO L226 Difference]: Without dead ends: 1952 [2022-04-28 15:31:59,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:31:59,964 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:59,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 15:31:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2022-04-28 15:32:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1950. [2022-04-28 15:32:01,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:01,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1952 states. Second operand has 1950 states, 1945 states have (on average 1.4853470437017995) internal successors, (2889), 1945 states have internal predecessors, (2889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:01,022 INFO L74 IsIncluded]: Start isIncluded. First operand 1952 states. Second operand has 1950 states, 1945 states have (on average 1.4853470437017995) internal successors, (2889), 1945 states have internal predecessors, (2889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:01,024 INFO L87 Difference]: Start difference. First operand 1952 states. Second operand has 1950 states, 1945 states have (on average 1.4853470437017995) internal successors, (2889), 1945 states have internal predecessors, (2889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:01,141 INFO L93 Difference]: Finished difference Result 1952 states and 2894 transitions. [2022-04-28 15:32:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2894 transitions. [2022-04-28 15:32:01,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:01,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:01,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 1950 states, 1945 states have (on average 1.4853470437017995) internal successors, (2889), 1945 states have internal predecessors, (2889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1952 states. [2022-04-28 15:32:01,146 INFO L87 Difference]: Start difference. First operand has 1950 states, 1945 states have (on average 1.4853470437017995) internal successors, (2889), 1945 states have internal predecessors, (2889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1952 states. [2022-04-28 15:32:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:01,258 INFO L93 Difference]: Finished difference Result 1952 states and 2894 transitions. [2022-04-28 15:32:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2894 transitions. [2022-04-28 15:32:01,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:01,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:01,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:01,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1945 states have (on average 1.4853470437017995) internal successors, (2889), 1945 states have internal predecessors, (2889), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2893 transitions. [2022-04-28 15:32:01,437 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2893 transitions. Word has length 134 [2022-04-28 15:32:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:01,437 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 2893 transitions. [2022-04-28 15:32:01,437 INFO L496 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-28 15:32:01,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1950 states and 2893 transitions. [2022-04-28 15:32:04,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2893 edges. 2893 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2893 transitions. [2022-04-28 15:32:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 15:32:04,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:04,153 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:32:04,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 15:32:04,154 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:04,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:04,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1945044763, now seen corresponding path program 1 times [2022-04-28 15:32:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:04,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376748868] [2022-04-28 15:32:04,245 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:04,245 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1945044763, now seen corresponding path program 2 times [2022-04-28 15:32:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:04,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859394841] [2022-04-28 15:32:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:04,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {119200#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {119194#true} is VALID [2022-04-28 15:32:04,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {119194#true} assume true; {119194#true} is VALID [2022-04-28 15:32:04,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119194#true} {119194#true} #689#return; {119194#true} is VALID [2022-04-28 15:32:04,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {119194#true} call ULTIMATE.init(); {119200#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {119200#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {119194#true} assume true; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119194#true} {119194#true} #689#return; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {119194#true} call #t~ret161 := main(); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {119194#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; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {119194#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L272 TraceCheckUtils]: 7: Hoare triple {119194#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {119194#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; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {119194#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; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {119194#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {119194#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {119194#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {119194#true} assume !false; {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {119194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {119194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {119194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 19: Hoare triple {119194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {119194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {119194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {119194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {119194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {119194#true} assume 8464 == #t~mem55;havoc #t~mem55; {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {119194#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; {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {119194#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {119194#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {119194#true} ~skip~0 := 0; {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {119194#true} assume !false; {119194#true} is VALID [2022-04-28 15:32:04,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {119194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {119194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {119194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {119194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {119194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {119194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 39: Hoare triple {119194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {119194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 41: Hoare triple {119194#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 42: Hoare triple {119194#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 43: Hoare triple {119194#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {119194#true} assume 8496 == #t~mem58;havoc #t~mem58; {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {119194#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {119194#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {119194#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {119194#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {119194#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {119194#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {119194#true} ~skip~0 := 0; {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 53: Hoare triple {119194#true} assume !false; {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 54: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 55: Hoare triple {119194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {119194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {119194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 58: Hoare triple {119194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {119194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {119194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {119194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {119194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {119194#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {119194#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 65: Hoare triple {119194#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {119194#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 67: Hoare triple {119194#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {119194#true} assume 8512 == #t~mem60;havoc #t~mem60; {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {119194#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); {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {119194#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; {119194#true} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {119194#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,352 INFO L290 TraceCheckUtils]: 72: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {119199#(<= 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); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {119199#(<= 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); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,353 INFO L290 TraceCheckUtils]: 76: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !false; {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,354 INFO L290 TraceCheckUtils]: 78: Hoare triple {119199#(<= 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); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,355 INFO L290 TraceCheckUtils]: 81: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,355 INFO L290 TraceCheckUtils]: 83: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,355 INFO L290 TraceCheckUtils]: 84: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,356 INFO L290 TraceCheckUtils]: 85: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,356 INFO L290 TraceCheckUtils]: 86: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,356 INFO L290 TraceCheckUtils]: 87: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,356 INFO L290 TraceCheckUtils]: 88: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,358 INFO L290 TraceCheckUtils]: 94: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,358 INFO L290 TraceCheckUtils]: 95: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,358 INFO L290 TraceCheckUtils]: 96: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,370 INFO L290 TraceCheckUtils]: 97: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,371 INFO L290 TraceCheckUtils]: 98: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,371 INFO L290 TraceCheckUtils]: 99: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,371 INFO L290 TraceCheckUtils]: 100: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,371 INFO L290 TraceCheckUtils]: 101: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,372 INFO L290 TraceCheckUtils]: 102: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,372 INFO L290 TraceCheckUtils]: 103: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,372 INFO L290 TraceCheckUtils]: 104: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,372 INFO L290 TraceCheckUtils]: 105: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,372 INFO L290 TraceCheckUtils]: 106: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,373 INFO L290 TraceCheckUtils]: 107: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,373 INFO L290 TraceCheckUtils]: 108: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,373 INFO L290 TraceCheckUtils]: 109: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,373 INFO L290 TraceCheckUtils]: 110: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,374 INFO L290 TraceCheckUtils]: 111: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 72 + ~s.offset, 4); {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,374 INFO L290 TraceCheckUtils]: 112: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume 8673 == #t~mem80;havoc #t~mem80; {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,374 INFO L290 TraceCheckUtils]: 113: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {119199#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:32:04,374 INFO L290 TraceCheckUtils]: 114: Hoare triple {119199#(<= 6 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {119195#false} is VALID [2022-04-28 15:32:04,374 INFO L290 TraceCheckUtils]: 115: Hoare triple {119195#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); {119195#false} is VALID [2022-04-28 15:32:04,374 INFO L290 TraceCheckUtils]: 116: Hoare triple {119195#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; {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 117: Hoare triple {119195#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 118: Hoare triple {119195#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); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 119: Hoare triple {119195#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 120: Hoare triple {119195#false} ~skip~0 := 0; {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 121: Hoare triple {119195#false} assume !false; {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 122: Hoare triple {119195#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); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 123: Hoare triple {119195#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 124: Hoare triple {119195#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 125: Hoare triple {119195#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 126: Hoare triple {119195#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 127: Hoare triple {119195#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 128: Hoare triple {119195#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 129: Hoare triple {119195#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 130: Hoare triple {119195#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 131: Hoare triple {119195#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 132: Hoare triple {119195#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 133: Hoare triple {119195#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,375 INFO L290 TraceCheckUtils]: 134: Hoare triple {119195#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 135: Hoare triple {119195#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 136: Hoare triple {119195#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 137: Hoare triple {119195#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 138: Hoare triple {119195#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 139: Hoare triple {119195#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 140: Hoare triple {119195#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 141: Hoare triple {119195#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 142: Hoare triple {119195#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 143: Hoare triple {119195#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 144: Hoare triple {119195#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 145: Hoare triple {119195#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 146: Hoare triple {119195#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 147: Hoare triple {119195#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 148: Hoare triple {119195#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 149: Hoare triple {119195#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 150: Hoare triple {119195#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 151: Hoare triple {119195#false} assume 8640 == #t~mem75;havoc #t~mem75; {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 152: Hoare triple {119195#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {119195#false} is VALID [2022-04-28 15:32:04,376 INFO L290 TraceCheckUtils]: 153: Hoare triple {119195#false} assume 4 == ~blastFlag~0; {119195#false} is VALID [2022-04-28 15:32:04,377 INFO L290 TraceCheckUtils]: 154: Hoare triple {119195#false} assume !false; {119195#false} is VALID [2022-04-28 15:32:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:32:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:04,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859394841] [2022-04-28 15:32:04,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859394841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:04,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:04,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:32:04,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:04,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376748868] [2022-04-28 15:32:04,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376748868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:04,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:04,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:32:04,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235486993] [2022-04-28 15:32:04,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:04,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-28 15:32:04,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:04,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:04,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:04,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:32:04,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:04,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:32:04,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:32:04,460 INFO L87 Difference]: Start difference. First operand 1950 states and 2893 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:08,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:12,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:16,148 INFO L93 Difference]: Finished difference Result 4358 states and 6478 transitions. [2022-04-28 15:32:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:32:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2022-04-28 15:32:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:32:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:32:16,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 605 transitions. [2022-04-28 15:32:16,522 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-28 15:32:16,771 INFO L225 Difference]: With dead ends: 4358 [2022-04-28 15:32:16,771 INFO L226 Difference]: Without dead ends: 2436 [2022-04-28 15:32:16,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:32:16,774 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 145 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:16,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 576 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-28 15:32:16,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-04-28 15:32:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2434. [2022-04-28 15:32:18,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:18,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2436 states. Second operand has 2434 states, 2429 states have (on average 1.478386167146974) internal successors, (3591), 2429 states have internal predecessors, (3591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:18,903 INFO L74 IsIncluded]: Start isIncluded. First operand 2436 states. Second operand has 2434 states, 2429 states have (on average 1.478386167146974) internal successors, (3591), 2429 states have internal predecessors, (3591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:18,904 INFO L87 Difference]: Start difference. First operand 2436 states. Second operand has 2434 states, 2429 states have (on average 1.478386167146974) internal successors, (3591), 2429 states have internal predecessors, (3591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:19,069 INFO L93 Difference]: Finished difference Result 2436 states and 3596 transitions. [2022-04-28 15:32:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3596 transitions. [2022-04-28 15:32:19,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:19,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:19,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 2434 states, 2429 states have (on average 1.478386167146974) internal successors, (3591), 2429 states have internal predecessors, (3591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2436 states. [2022-04-28 15:32:19,074 INFO L87 Difference]: Start difference. First operand has 2434 states, 2429 states have (on average 1.478386167146974) internal successors, (3591), 2429 states have internal predecessors, (3591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2436 states. [2022-04-28 15:32:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:19,238 INFO L93 Difference]: Finished difference Result 2436 states and 3596 transitions. [2022-04-28 15:32:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3596 transitions. [2022-04-28 15:32:19,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:19,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:19,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:19,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2429 states have (on average 1.478386167146974) internal successors, (3591), 2429 states have internal predecessors, (3591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3595 transitions. [2022-04-28 15:32:19,502 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3595 transitions. Word has length 155 [2022-04-28 15:32:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:19,502 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3595 transitions. [2022-04-28 15:32:19,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:19,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2434 states and 3595 transitions. [2022-04-28 15:32:23,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3595 edges. 3595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3595 transitions. [2022-04-28 15:32:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:32:23,073 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:23,073 INFO L195 NwaCegarLoop]: 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-28 15:32:23,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 15:32:23,074 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 428867290, now seen corresponding path program 1 times [2022-04-28 15:32:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:23,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1313704033] [2022-04-28 15:32:23,204 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:23,204 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash 428867290, now seen corresponding path program 2 times [2022-04-28 15:32:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:23,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937621185] [2022-04-28 15:32:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:23,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {137668#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {137659#true} is VALID [2022-04-28 15:32:23,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {137659#true} assume true; {137659#true} is VALID [2022-04-28 15:32:23,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137659#true} {137659#true} #689#return; {137659#true} is VALID [2022-04-28 15:32:23,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {137659#true} call ULTIMATE.init(); {137668#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:32:23,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {137668#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {137659#true} is VALID [2022-04-28 15:32:23,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {137659#true} assume true; {137659#true} is VALID [2022-04-28 15:32:23,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137659#true} {137659#true} #689#return; {137659#true} is VALID [2022-04-28 15:32:23,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {137659#true} call #t~ret161 := main(); {137659#true} is VALID [2022-04-28 15:32:23,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {137659#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; {137659#true} is VALID [2022-04-28 15:32:23,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {137659#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {137664#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:32:23,579 INFO L272 TraceCheckUtils]: 7: Hoare triple {137664#(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); {137665#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:32:23,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {137665#(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); {137666#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:23,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {137666#(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; {137666#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:23,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {137666#(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; {137666#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:23,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {137666#(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)))); {137666#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:32:23,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {137666#(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); {137667#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:32:23,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {137667#(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; {137660#false} is VALID [2022-04-28 15:32:23,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {137660#false} assume !false; {137660#false} is VALID [2022-04-28 15:32:23,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {137660#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {137660#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {137660#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {137660#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {137660#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {137660#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {137660#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 23: Hoare triple {137660#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {137660#false} assume 8464 == #t~mem55;havoc #t~mem55; {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {137660#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; {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {137660#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {137660#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 30: Hoare triple {137660#false} ~skip~0 := 0; {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {137660#false} assume !false; {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {137660#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 34: Hoare triple {137660#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 35: Hoare triple {137660#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {137660#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {137660#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {137660#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {137660#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {137660#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,586 INFO L290 TraceCheckUtils]: 41: Hoare triple {137660#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {137660#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {137660#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {137660#false} assume 8496 == #t~mem58;havoc #t~mem58; {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 45: Hoare triple {137660#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 46: Hoare triple {137660#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {137660#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {137660#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {137660#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 50: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {137660#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {137660#false} ~skip~0 := 0; {137660#false} is VALID [2022-04-28 15:32:23,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {137660#false} assume !false; {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {137660#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {137660#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {137660#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {137660#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 59: Hoare triple {137660#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {137660#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {137660#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {137660#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {137660#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 64: Hoare triple {137660#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 65: Hoare triple {137660#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,588 INFO L290 TraceCheckUtils]: 66: Hoare triple {137660#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {137660#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {137660#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 69: Hoare triple {137660#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {137660#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 71: Hoare triple {137660#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 72: Hoare triple {137660#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 73: Hoare triple {137660#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 74: Hoare triple {137660#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 75: Hoare triple {137660#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {137660#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 77: Hoare triple {137660#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 78: Hoare triple {137660#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,589 INFO L290 TraceCheckUtils]: 79: Hoare triple {137660#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 80: Hoare triple {137660#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {137660#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 82: Hoare triple {137660#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 83: Hoare triple {137660#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 84: Hoare triple {137660#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {137660#false} assume 8656 == #t~mem77;havoc #t~mem77; {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {137660#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; {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 87: Hoare triple {137660#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 88: Hoare triple {137660#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 89: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 90: Hoare triple {137660#false} assume !(0 == ~tmp___10~0); {137660#false} is VALID [2022-04-28 15:32:23,590 INFO L290 TraceCheckUtils]: 91: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 92: Hoare triple {137660#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 93: Hoare triple {137660#false} ~skip~0 := 0; {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 94: Hoare triple {137660#false} assume !false; {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 95: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {137660#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {137660#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 98: Hoare triple {137660#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 99: Hoare triple {137660#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 100: Hoare triple {137660#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 101: Hoare triple {137660#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 102: Hoare triple {137660#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 103: Hoare triple {137660#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {137660#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 105: Hoare triple {137660#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 106: Hoare triple {137660#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {137660#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 108: Hoare triple {137660#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 109: Hoare triple {137660#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {137660#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 111: Hoare triple {137660#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {137660#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 113: Hoare triple {137660#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 114: Hoare triple {137660#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 115: Hoare triple {137660#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 116: Hoare triple {137660#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 117: Hoare triple {137660#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 118: Hoare triple {137660#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,592 INFO L290 TraceCheckUtils]: 119: Hoare triple {137660#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {137660#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 121: Hoare triple {137660#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 122: Hoare triple {137660#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 123: Hoare triple {137660#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 124: Hoare triple {137660#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 125: Hoare triple {137660#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 126: Hoare triple {137660#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 127: Hoare triple {137660#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 128: Hoare triple {137660#false} assume 8672 == #t~mem79;havoc #t~mem79; {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 129: Hoare triple {137660#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 130: Hoare triple {137660#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 131: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 132: Hoare triple {137660#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; {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 133: Hoare triple {137660#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 134: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,593 INFO L290 TraceCheckUtils]: 135: Hoare triple {137660#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 136: Hoare triple {137660#false} ~skip~0 := 0; {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 137: Hoare triple {137660#false} assume !false; {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 138: Hoare triple {137660#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); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 139: Hoare triple {137660#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 140: Hoare triple {137660#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 141: Hoare triple {137660#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 142: Hoare triple {137660#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 143: Hoare triple {137660#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 144: Hoare triple {137660#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 145: Hoare triple {137660#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 146: Hoare triple {137660#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 147: Hoare triple {137660#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,594 INFO L290 TraceCheckUtils]: 148: Hoare triple {137660#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 149: Hoare triple {137660#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 150: Hoare triple {137660#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 151: Hoare triple {137660#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 152: Hoare triple {137660#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 153: Hoare triple {137660#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 154: Hoare triple {137660#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 155: Hoare triple {137660#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 156: Hoare triple {137660#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 157: Hoare triple {137660#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 158: Hoare triple {137660#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,595 INFO L290 TraceCheckUtils]: 159: Hoare triple {137660#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 160: Hoare triple {137660#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 161: Hoare triple {137660#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 162: Hoare triple {137660#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 163: Hoare triple {137660#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 164: Hoare triple {137660#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 165: Hoare triple {137660#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 166: Hoare triple {137660#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 167: Hoare triple {137660#false} assume 8640 == #t~mem75;havoc #t~mem75; {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 168: Hoare triple {137660#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 169: Hoare triple {137660#false} assume 4 == ~blastFlag~0; {137660#false} is VALID [2022-04-28 15:32:23,596 INFO L290 TraceCheckUtils]: 170: Hoare triple {137660#false} assume !false; {137660#false} is VALID [2022-04-28 15:32:23,597 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-28 15:32:23,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:23,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937621185] [2022-04-28 15:32:23,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937621185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:23,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:23,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:32:23,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:23,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1313704033] [2022-04-28 15:32:23,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1313704033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:23,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:23,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:32:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724717613] [2022-04-28 15:32:23,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:23,598 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-28 15:32:23,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:23,598 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-28 15:32:23,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:32:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:32:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:32:23,666 INFO L87 Difference]: Start difference. First operand 2434 states and 3595 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-28 15:32:27,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:29,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:31,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:34,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:36,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:38,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:43,620 INFO L93 Difference]: Finished difference Result 4861 states and 7182 transitions. [2022-04-28 15:32:43,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:32:43,620 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-28 15:32:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:43,621 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-28 15:32:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:32:43,622 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-28 15:32:43,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:32:43,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-28 15:32:43,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:44,131 INFO L225 Difference]: With dead ends: 4861 [2022-04-28 15:32:44,132 INFO L226 Difference]: Without dead ends: 2434 [2022-04-28 15:32:44,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:32:44,134 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:44,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 3 Unknown, 0 Unchecked, 11.2s Time] [2022-04-28 15:32:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2022-04-28 15:32:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2022-04-28 15:32:46,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:46,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2434 states. Second operand has 2434 states, 2429 states have (on average 1.4779744750926307) internal successors, (3590), 2429 states have internal predecessors, (3590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,273 INFO L74 IsIncluded]: Start isIncluded. First operand 2434 states. Second operand has 2434 states, 2429 states have (on average 1.4779744750926307) internal successors, (3590), 2429 states have internal predecessors, (3590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,275 INFO L87 Difference]: Start difference. First operand 2434 states. Second operand has 2434 states, 2429 states have (on average 1.4779744750926307) internal successors, (3590), 2429 states have internal predecessors, (3590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:46,516 INFO L93 Difference]: Finished difference Result 2434 states and 3594 transitions. [2022-04-28 15:32:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:32:46,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:46,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:46,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 2434 states, 2429 states have (on average 1.4779744750926307) internal successors, (3590), 2429 states have internal predecessors, (3590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2434 states. [2022-04-28 15:32:46,523 INFO L87 Difference]: Start difference. First operand has 2434 states, 2429 states have (on average 1.4779744750926307) internal successors, (3590), 2429 states have internal predecessors, (3590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2434 states. [2022-04-28 15:32:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:46,780 INFO L93 Difference]: Finished difference Result 2434 states and 3594 transitions. [2022-04-28 15:32:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:32:46,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:46,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:46,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:46,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2429 states have (on average 1.4779744750926307) internal successors, (3590), 2429 states have internal predecessors, (3590), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3594 transitions. [2022-04-28 15:32:47,160 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3594 transitions. Word has length 171 [2022-04-28 15:32:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:47,161 INFO L495 AbstractCegarLoop]: Abstraction has 2434 states and 3594 transitions. [2022-04-28 15:32:47,161 INFO L496 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-28 15:32:47,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2434 states and 3594 transitions. [2022-04-28 15:32:51,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3594 edges. 3594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3594 transitions. [2022-04-28 15:32:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:32:51,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:51,280 INFO L195 NwaCegarLoop]: 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-28 15:32:51,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 15:32:51,280 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1494383140, now seen corresponding path program 1 times [2022-04-28 15:32:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:51,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330664898] [2022-04-28 15:32:51,389 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:51,389 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:51,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1494383140, now seen corresponding path program 2 times [2022-04-28 15:32:51,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:51,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665896415] [2022-04-28 15:32:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:51,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:52,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:52,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {157150#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {157135#true} is VALID [2022-04-28 15:32:52,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {157135#true} assume true; {157135#true} is VALID [2022-04-28 15:32:52,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157135#true} {157135#true} #689#return; {157135#true} is VALID [2022-04-28 15:32:52,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {157135#true} call ULTIMATE.init(); {157150#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:32:52,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {157150#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 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); {157135#true} is VALID [2022-04-28 15:32:52,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {157135#true} assume true; {157135#true} is VALID [2022-04-28 15:32:52,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157135#true} {157135#true} #689#return; {157135#true} is VALID [2022-04-28 15:32:52,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {157135#true} call #t~ret161 := main(); {157135#true} is VALID [2022-04-28 15:32:52,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {157135#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; {157140#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))))} is VALID [2022-04-28 15:32:52,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {157140#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (= (select |#valid| main_~s~0.base) 1) (<= main_~s~0.offset 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) 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; {157141#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))) (<= main_~s~0.offset 0))} is VALID [2022-04-28 15:32:52,538 INFO L272 TraceCheckUtils]: 7: Hoare triple {157141#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ 116 main_~s~0.offset)) 0) (or (<= main_~s~0.offset (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 248))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset))) 888)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)))) (<= main_~s~0.offset 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {157142#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))) 888) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))))) (<= |ssl3_accept_#in~s.offset| (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)) 0) (<= |ssl3_accept_#in~s.offset| 0))} is VALID [2022-04-28 15:32:52,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {157142#(and (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))) 888) 0) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|))))) (<= |ssl3_accept_#in~s.offset| (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)) 0) (<= |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); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !false; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 8464 == #t~mem55;havoc #t~mem55; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} 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); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,554 INFO L290 TraceCheckUtils]: 28: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} ~skip~0 := 0; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !false; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,562 INFO L290 TraceCheckUtils]: 42: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 8496 == #t~mem58;havoc #t~mem58; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,564 INFO L290 TraceCheckUtils]: 45: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,565 INFO L290 TraceCheckUtils]: 47: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,566 INFO L290 TraceCheckUtils]: 48: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {157143#(and (or (<= ssl3_accept_~s.offset (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) 888) 0))) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 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); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} ~skip~0 := 0; {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !false; {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 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); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,570 INFO L290 TraceCheckUtils]: 55: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,570 INFO L290 TraceCheckUtils]: 56: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,571 INFO L290 TraceCheckUtils]: 57: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,572 INFO L290 TraceCheckUtils]: 59: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,572 INFO L290 TraceCheckUtils]: 60: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,573 INFO L290 TraceCheckUtils]: 63: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,574 INFO L290 TraceCheckUtils]: 64: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,574 INFO L290 TraceCheckUtils]: 65: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,575 INFO L290 TraceCheckUtils]: 66: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,575 INFO L290 TraceCheckUtils]: 67: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,576 INFO L290 TraceCheckUtils]: 68: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,576 INFO L290 TraceCheckUtils]: 69: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,577 INFO L290 TraceCheckUtils]: 70: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,577 INFO L290 TraceCheckUtils]: 71: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,578 INFO L290 TraceCheckUtils]: 72: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,578 INFO L290 TraceCheckUtils]: 73: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,578 INFO L290 TraceCheckUtils]: 74: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,579 INFO L290 TraceCheckUtils]: 75: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,579 INFO L290 TraceCheckUtils]: 76: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,580 INFO L290 TraceCheckUtils]: 77: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,580 INFO L290 TraceCheckUtils]: 78: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,582 INFO L290 TraceCheckUtils]: 82: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,583 INFO L290 TraceCheckUtils]: 83: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,583 INFO L290 TraceCheckUtils]: 84: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,584 INFO L290 TraceCheckUtils]: 85: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} assume 8656 == #t~mem77;havoc #t~mem77; {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,584 INFO L290 TraceCheckUtils]: 86: Hoare triple {157144#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))) (+ 888 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)))) 0) (not (= (+ 192 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248))) (+ 116 ssl3_accept_~s.offset)))) (<= ssl3_accept_~s.offset 0))} 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; {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,585 INFO L290 TraceCheckUtils]: 87: Hoare triple {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} assume !(0 == ~tmp___10~0); {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 0))} is VALID [2022-04-28 15:32:52,587 INFO L290 TraceCheckUtils]: 91: Hoare triple {157145#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) 0) (<= ssl3_accept_~s.offset 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); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,587 INFO L290 TraceCheckUtils]: 92: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} ~skip~0 := 0; {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,588 INFO L290 TraceCheckUtils]: 94: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !false; {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,588 INFO L290 TraceCheckUtils]: 95: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} 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); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,588 INFO L290 TraceCheckUtils]: 96: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,588 INFO L290 TraceCheckUtils]: 97: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,589 INFO L290 TraceCheckUtils]: 98: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,589 INFO L290 TraceCheckUtils]: 99: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,589 INFO L290 TraceCheckUtils]: 100: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,589 INFO L290 TraceCheckUtils]: 101: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,590 INFO L290 TraceCheckUtils]: 103: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,590 INFO L290 TraceCheckUtils]: 104: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,590 INFO L290 TraceCheckUtils]: 105: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,591 INFO L290 TraceCheckUtils]: 107: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,591 INFO L290 TraceCheckUtils]: 108: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,591 INFO L290 TraceCheckUtils]: 109: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,592 INFO L290 TraceCheckUtils]: 110: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,592 INFO L290 TraceCheckUtils]: 111: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,592 INFO L290 TraceCheckUtils]: 112: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,592 INFO L290 TraceCheckUtils]: 113: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,593 INFO L290 TraceCheckUtils]: 114: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,593 INFO L290 TraceCheckUtils]: 115: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,593 INFO L290 TraceCheckUtils]: 116: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,593 INFO L290 TraceCheckUtils]: 117: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,594 INFO L290 TraceCheckUtils]: 118: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,594 INFO L290 TraceCheckUtils]: 119: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,594 INFO L290 TraceCheckUtils]: 120: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,594 INFO L290 TraceCheckUtils]: 121: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,594 INFO L290 TraceCheckUtils]: 122: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,607 INFO L290 TraceCheckUtils]: 123: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,607 INFO L290 TraceCheckUtils]: 124: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,608 INFO L290 TraceCheckUtils]: 125: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,608 INFO L290 TraceCheckUtils]: 126: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,608 INFO L290 TraceCheckUtils]: 127: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,608 INFO L290 TraceCheckUtils]: 128: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume 8672 == #t~mem79;havoc #t~mem79; {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,609 INFO L290 TraceCheckUtils]: 129: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,609 INFO L290 TraceCheckUtils]: 130: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} is VALID [2022-04-28 15:32:52,610 INFO L290 TraceCheckUtils]: 131: Hoare triple {157146#(<= ssl3_accept_~s.offset (+ 831 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))} 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); {157147#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))) (not (= ssl3_accept_~s.offset (+ 832 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))))} is VALID [2022-04-28 15:32:52,611 INFO L290 TraceCheckUtils]: 132: Hoare triple {157147#(and (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))) (not (= ssl3_accept_~s.offset (+ 832 (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset))))))} 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; {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,611 INFO L290 TraceCheckUtils]: 133: Hoare triple {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,612 INFO L290 TraceCheckUtils]: 134: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,612 INFO L290 TraceCheckUtils]: 135: Hoare triple {157148#(= 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; {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,612 INFO L290 TraceCheckUtils]: 136: Hoare triple {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,613 INFO L290 TraceCheckUtils]: 137: Hoare triple {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,613 INFO L290 TraceCheckUtils]: 138: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,613 INFO L290 TraceCheckUtils]: 139: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,614 INFO L290 TraceCheckUtils]: 140: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,614 INFO L290 TraceCheckUtils]: 141: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,614 INFO L290 TraceCheckUtils]: 142: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,615 INFO L290 TraceCheckUtils]: 143: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,615 INFO L290 TraceCheckUtils]: 144: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,615 INFO L290 TraceCheckUtils]: 145: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,616 INFO L290 TraceCheckUtils]: 146: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,616 INFO L290 TraceCheckUtils]: 147: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,616 INFO L290 TraceCheckUtils]: 148: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,617 INFO L290 TraceCheckUtils]: 149: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,617 INFO L290 TraceCheckUtils]: 150: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,617 INFO L290 TraceCheckUtils]: 151: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,618 INFO L290 TraceCheckUtils]: 152: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,618 INFO L290 TraceCheckUtils]: 153: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,618 INFO L290 TraceCheckUtils]: 154: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,619 INFO L290 TraceCheckUtils]: 155: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,619 INFO L290 TraceCheckUtils]: 156: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,619 INFO L290 TraceCheckUtils]: 157: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 158: Hoare triple {157148#(= 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); {157148#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 159: Hoare triple {157148#(= 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); {157149#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 160: Hoare triple {157149#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 161: Hoare triple {157136#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 162: Hoare triple {157136#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 163: Hoare triple {157136#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,620 INFO L290 TraceCheckUtils]: 164: Hoare triple {157136#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,621 INFO L290 TraceCheckUtils]: 165: Hoare triple {157136#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,621 INFO L290 TraceCheckUtils]: 166: Hoare triple {157136#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157136#false} is VALID [2022-04-28 15:32:52,621 INFO L290 TraceCheckUtils]: 167: Hoare triple {157136#false} assume 8640 == #t~mem75;havoc #t~mem75; {157136#false} is VALID [2022-04-28 15:32:52,621 INFO L290 TraceCheckUtils]: 168: Hoare triple {157136#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {157136#false} is VALID [2022-04-28 15:32:52,621 INFO L290 TraceCheckUtils]: 169: Hoare triple {157136#false} assume 4 == ~blastFlag~0; {157136#false} is VALID [2022-04-28 15:32:52,621 INFO L290 TraceCheckUtils]: 170: Hoare triple {157136#false} assume !false; {157136#false} is VALID [2022-04-28 15:32:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 15:32:52,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:52,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665896415] [2022-04-28 15:32:52,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665896415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 15:32:52,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910110934] [2022-04-28 15:32:52,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 15:32:52,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 15:32:52,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:32:52,624 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-28 15:32:52,627 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-28 15:33:25,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 15:33:25,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 15:33:25,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 228 conjunts are in the unsatisfiable core [2022-04-28 15:33:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:25,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 15:33:26,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:26,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:27,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:33:27,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11573 treesize of output 2526 [2022-04-28 15:33:33,212 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 15:33:33,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 15:33:33,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 15:33:33,428 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_1 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:825) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:786) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:704) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:275) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 15:33:33,431 INFO L158 Benchmark]: Toolchain (without parser) took 436811.41ms. Allocated memory was 210.8MB in the beginning and 405.8MB in the end (delta: 195.0MB). Free memory was 157.5MB in the beginning and 263.2MB in the end (delta: -105.7MB). Peak memory consumption was 274.6MB. Max. memory is 8.0GB. [2022-04-28 15:33:33,431 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory was 176.4MB in the beginning and 176.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:33:33,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.33ms. Allocated memory is still 210.8MB. Free memory was 157.2MB in the beginning and 162.8MB in the end (delta: -5.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 15:33:33,431 INFO L158 Benchmark]: Boogie Preprocessor took 79.03ms. Allocated memory is still 210.8MB. Free memory was 162.8MB in the beginning and 153.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:33:33,432 INFO L158 Benchmark]: RCFGBuilder took 1432.69ms. Allocated memory was 210.8MB in the beginning and 281.0MB in the end (delta: 70.3MB). Free memory was 153.0MB in the beginning and 187.2MB in the end (delta: -34.2MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. [2022-04-28 15:33:33,432 INFO L158 Benchmark]: TraceAbstraction took 434765.63ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 186.6MB in the beginning and 263.2MB in the end (delta: -76.6MB). Peak memory consumption was 234.1MB. Max. memory is 8.0GB. [2022-04-28 15:33:33,432 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory was 176.4MB in the beginning and 176.2MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 529.33ms. Allocated memory is still 210.8MB. Free memory was 157.2MB in the beginning and 162.8MB in the end (delta: -5.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.03ms. Allocated memory is still 210.8MB. Free memory was 162.8MB in the beginning and 153.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1432.69ms. Allocated memory was 210.8MB in the beginning and 281.0MB in the end (delta: 70.3MB). Free memory was 153.0MB in the beginning and 187.2MB in the end (delta: -34.2MB). Peak memory consumption was 37.0MB. Max. memory is 8.0GB. * TraceAbstraction took 434765.63ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 186.6MB in the beginning and 263.2MB in the end (delta: -76.6MB). Peak memory consumption was 234.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_1: 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-28 15:33:33,479 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...