/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 15:30:05,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 15:30:05,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 15:30:05,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 15:30:05,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 15:30:05,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 15:30:05,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 15:30:05,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 15:30:05,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 15:30:05,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 15:30:05,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 15:30:05,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 15:30:05,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 15:30:05,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 15:30:05,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 15:30:05,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 15:30:05,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 15:30:05,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 15:30:05,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 15:30:05,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 15:30:05,321 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 15:30:05,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 15:30:05,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 15:30:05,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 15:30:05,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 15:30:05,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 15:30:05,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 15:30:05,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 15:30:05,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 15:30:05,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 15:30:05,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 15:30:05,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 15:30:05,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 15:30:05,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 15:30:05,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 15:30:05,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 15:30:05,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 15:30:05,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 15:30:05,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 15:30:05,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 15:30:05,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 15:30:05,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 15:30:05,338 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:30:05,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 15:30:05,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 15:30:05,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 15:30:05,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 15:30:05,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 15:30:05,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 15:30:05,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 15:30:05,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 15:30:05,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 15:30:05,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:30:05,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 15:30:05,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 15:30:05,351 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 15:30:05,351 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 15:30:05,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 15:30:05,351 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 15:30:05,351 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:30:05,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 15:30:05,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 15:30:05,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 15:30:05,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 15:30:05,563 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 15:30:05,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c [2022-04-28 15:30:05,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bae136d9/d4dda74a716f44a898e3a22a731c8ec1/FLAG5fe98a4eb [2022-04-28 15:30:06,054 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 15:30:06,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c [2022-04-28 15:30:06,075 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bae136d9/d4dda74a716f44a898e3a22a731c8ec1/FLAG5fe98a4eb [2022-04-28 15:30:06,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bae136d9/d4dda74a716f44a898e3a22a731c8ec1 [2022-04-28 15:30:06,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 15:30:06,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 15:30:06,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 15:30:06,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 15:30:06,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 15:30:06,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e6868b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06, skipping insertion in model container [2022-04-28 15:30:06,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 15:30:06,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 15:30:06,744 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c[74353,74366] [2022-04-28 15:30:06,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:30:06,758 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 15:30:06,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.13.i.cil-2.c[74353,74366] [2022-04-28 15:30:06,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 15:30:06,843 INFO L208 MainTranslator]: Completed translation [2022-04-28 15:30:06,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06 WrapperNode [2022-04-28 15:30:06,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 15:30:06,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 15:30:06,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 15:30:06,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 15:30:06,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 15:30:06,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 15:30:06,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 15:30:06,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 15:30:06,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (1/1) ... [2022-04-28 15:30:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 15:30:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:30:07,012 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:30:07,031 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:30:07,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 15:30:07,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 15:30:07,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 15:30:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 15:30:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 15:30:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 15:30:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 15:30:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 15:30:07,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 15:30:07,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 15:30:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 15:30:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 15:30:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 15:30:07,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 15:30:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 15:30:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 15:30:07,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 15:30:07,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 15:30:07,231 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 15:30:07,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 15:30:07,857 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 15:30:08,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 15:30:08,271 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 15:30:08,282 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 15:30:08,288 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 15:30:08,288 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 15:30:08,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:30:08 BoogieIcfgContainer [2022-04-28 15:30:08,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 15:30:08,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 15:30:08,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 15:30:08,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 15:30:08,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:30:06" (1/3) ... [2022-04-28 15:30:08,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aee43ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:30:08, skipping insertion in model container [2022-04-28 15:30:08,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:30:06" (2/3) ... [2022-04-28 15:30:08,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aee43ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:30:08, skipping insertion in model container [2022-04-28 15:30:08,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:30:08" (3/3) ... [2022-04-28 15:30:08,338 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2022-04-28 15:30:08,349 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 15:30:08,349 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 15:30:08,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 15:30:08,390 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@5c6177b7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14b4465f [2022-04-28 15:30:08,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 15:30:08,399 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:30:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 15:30:08,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:08,413 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:30:08,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 1 times [2022-04-28 15:30:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:08,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1585138576] [2022-04-28 15:30:08,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:30:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -671352377, now seen corresponding path program 2 times [2022-04-28 15:30:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:08,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739559470] [2022-04-28 15:30:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:08,855 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:30:08,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:30:08,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-28 15:30:08,857 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:30:08,858 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:30:08,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 15:30:08,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #690#return; {161#true} is VALID [2022-04-28 15:30:08,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret161 := main(); {161#true} is VALID [2022-04-28 15:30:08,859 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:30:08,859 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:30:08,859 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:30:08,862 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:30:08,863 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:30:08,880 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:30:08,881 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:30:08,882 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:30:08,882 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:30:08,883 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:30:08,884 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:30:08,884 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:30:08,885 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:30:08,885 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:30:08,886 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:30:08,887 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:30:08,887 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:30:08,888 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:30:08,889 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:30:08,889 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:30:08,890 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:30:08,890 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:30:08,891 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:30:08,891 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:30:08,892 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:30:08,892 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:30:08,893 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:30:08,893 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:30:08,894 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:30:08,894 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:30:08,894 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:30:08,894 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:30:08,894 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:30:08,895 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:30:08,895 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:30:08,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {162#false} assume 8 == ~blastFlag~0; {162#false} is VALID [2022-04-28 15:30:08,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 15:30:08,896 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:30:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:08,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739559470] [2022-04-28 15:30:08,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739559470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:08,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:08,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:08,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:08,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1585138576] [2022-04-28 15:30:08,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1585138576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:08,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:08,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:08,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120768362] [2022-04-28 15:30:08,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:08,904 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:30:08,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:08,907 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:30:08,951 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:30:08,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:08,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:08,981 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:30:12,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:15,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:17,989 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:30:21,083 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:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:22,630 INFO L93 Difference]: Finished difference Result 430 states and 727 transitions. [2022-04-28 15:30:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:22,632 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:30:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:22,633 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:30:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 15:30:22,650 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:30:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2022-04-28 15:30:22,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 727 transitions. [2022-04-28 15:30:23,168 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:30:23,183 INFO L225 Difference]: With dead ends: 430 [2022-04-28 15:30:23,183 INFO L226 Difference]: Without dead ends: 261 [2022-04-28 15:30:23,185 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:23,187 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:23,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 461 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 15:30:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-28 15:30:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 170. [2022-04-28 15:30:23,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:23,215 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:30:23,216 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:30:23,216 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:30:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:23,225 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 15:30:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 15:30:23,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:23,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:23,226 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:30:23,227 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:30:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:23,235 INFO L93 Difference]: Finished difference Result 261 states and 400 transitions. [2022-04-28 15:30:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 400 transitions. [2022-04-28 15:30:23,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:23,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:23,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:23,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:23,237 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:30:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 265 transitions. [2022-04-28 15:30:23,242 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 265 transitions. Word has length 42 [2022-04-28 15:30:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:23,242 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 265 transitions. [2022-04-28 15:30:23,242 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:30:23,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 265 transitions. [2022-04-28 15:30:23,455 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:30:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 265 transitions. [2022-04-28 15:30:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 15:30:23,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:23,457 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:30:23,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 15:30:23,457 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 1 times [2022-04-28 15:30:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:23,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1713380514] [2022-04-28 15:30:23,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:30:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1244096364, now seen corresponding path program 2 times [2022-04-28 15:30:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:23,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060847288] [2022-04-28 15:30:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:23,703 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:30:23,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 15:30:23,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-28 15:30:23,712 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:30:23,712 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:30:23,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-28 15:30:23,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #690#return; {1895#true} is VALID [2022-04-28 15:30:23,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret161 := main(); {1895#true} is VALID [2022-04-28 15:30:23,713 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:30:23,713 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:30:23,713 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:30:23,716 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:30:23,717 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:30:23,717 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:30:23,718 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:30:23,718 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:30:23,719 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:30:23,719 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:30:23,720 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:30:23,721 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:30:23,721 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:30:23,722 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:30:23,722 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:30:23,723 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:30:23,723 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:30:23,724 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:30:23,724 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:30:23,725 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:30:23,725 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:30:23,726 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:30:23,726 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:30:23,727 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:30:23,727 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:30:23,728 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:30:23,728 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:30:23,729 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:30:23,729 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:30:23,730 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:30:23,730 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:30:23,730 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:30:23,730 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:30:23,730 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:30:23,731 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:30:23,731 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:30:23,731 INFO L290 TraceCheckUtils]: 41: Hoare triple {1896#false} assume 8 == ~blastFlag~0; {1896#false} is VALID [2022-04-28 15:30:23,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-28 15:30:23,734 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:30:23,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060847288] [2022-04-28 15:30:23,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060847288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:23,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:23,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:23,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:23,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1713380514] [2022-04-28 15:30:23,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1713380514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:23,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:23,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343379094] [2022-04-28 15:30:23,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:23,741 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:30:23,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:23,742 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:30:23,781 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:30:23,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:23,783 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:30:27,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:29,355 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:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:34,963 INFO L93 Difference]: Finished difference Result 444 states and 697 transitions. [2022-04-28 15:30:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:34,964 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:30:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:34,964 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:30:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:30:34,969 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:30:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:30:34,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 15:30:35,432 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:30:35,460 INFO L225 Difference]: With dead ends: 444 [2022-04-28 15:30:35,460 INFO L226 Difference]: Without dead ends: 289 [2022-04-28 15:30:35,461 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:35,462 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 134 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:35,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 342 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 476 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 15:30:35,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-28 15:30:35,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 199. [2022-04-28 15:30:35,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:35,474 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:30:35,475 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:30:35,475 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:30:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:35,487 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 15:30:35,488 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 15:30:35,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:35,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:35,488 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:30:35,489 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:30:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:35,498 INFO L93 Difference]: Finished difference Result 289 states and 450 transitions. [2022-04-28 15:30:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 450 transitions. [2022-04-28 15:30:35,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:35,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:35,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:35,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:35,499 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:30:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-28 15:30:35,503 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 43 [2022-04-28 15:30:35,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:35,503 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-28 15:30:35,504 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:30:35,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-28 15:30:35,722 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:30:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-28 15:30:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 15:30:35,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:35,723 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:30:35,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 15:30:35,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2016462011, now seen corresponding path program 1 times [2022-04-28 15:30:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:35,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855200753] [2022-04-28 15:30:35,724 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:30:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2016462011, now seen corresponding path program 2 times [2022-04-28 15:30:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:35,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123156889] [2022-04-28 15:30:35,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:35,868 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:30:35,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 15:30:35,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-28 15:30:35,869 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:30:35,869 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:30:35,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {3771#true} assume true; {3771#true} is VALID [2022-04-28 15:30:35,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3771#true} {3771#true} #690#return; {3771#true} is VALID [2022-04-28 15:30:35,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {3771#true} call #t~ret161 := main(); {3771#true} is VALID [2022-04-28 15:30:35,870 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:30:35,870 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:30:35,870 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:30:35,872 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:30:35,873 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:30:35,873 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:30:35,874 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:30:35,874 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:30:35,875 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:30:35,875 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:30:35,875 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:30:35,876 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:30:35,876 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:30:35,877 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:30:35,877 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:30:35,898 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:30:35,898 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:30:35,899 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:30:35,899 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:30:35,900 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:30:35,901 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:30:35,901 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:30:35,902 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:30:35,903 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:30:35,910 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:30:35,910 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:30:35,911 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:30:35,911 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:30:35,911 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:30:35,912 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:30:35,912 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:30:35,913 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:30:35,913 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:30:35,913 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:30:35,914 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:30:35,915 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:30:35,916 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:30:35,916 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:30:35,916 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:30:35,917 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:30:35,917 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:30:35,917 INFO L290 TraceCheckUtils]: 46: Hoare triple {3772#false} assume 4 == ~blastFlag~0; {3772#false} is VALID [2022-04-28 15:30:35,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {3772#false} assume !false; {3772#false} is VALID [2022-04-28 15:30:35,917 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:30:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:35,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123156889] [2022-04-28 15:30:35,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123156889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:35,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:35,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:35,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:35,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855200753] [2022-04-28 15:30:35,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855200753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:35,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:35,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165285312] [2022-04-28 15:30:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:35,919 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:30:35,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:35,919 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:30:35,972 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:30:35,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:35,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:35,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:35,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:35,973 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:30:40,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:30:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:45,857 INFO L93 Difference]: Finished difference Result 503 states and 800 transitions. [2022-04-28 15:30:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:45,858 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:30:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:45,858 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:30:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:30:45,862 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:30:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-04-28 15:30:45,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 597 transitions. [2022-04-28 15:30:46,290 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:30:46,296 INFO L225 Difference]: With dead ends: 503 [2022-04-28 15:30:46,296 INFO L226 Difference]: Without dead ends: 319 [2022-04-28 15:30:46,296 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:46,297 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:30:46,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 344 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 15:30:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-28 15:30:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2022-04-28 15:30:46,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:46,309 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:30:46,309 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:30:46,309 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:30:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:46,315 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 15:30:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 15:30:46,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:46,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:46,316 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:30:46,316 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:30:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:46,323 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2022-04-28 15:30:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 501 transitions. [2022-04-28 15:30:46,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:46,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:46,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:46,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:46,325 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:30:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 388 transitions. [2022-04-28 15:30:46,329 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 388 transitions. Word has length 48 [2022-04-28 15:30:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:46,329 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 388 transitions. [2022-04-28 15:30:46,329 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:30:46,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 388 transitions. [2022-04-28 15:30:46,604 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:30:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 388 transitions. [2022-04-28 15:30:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 15:30:46,605 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:46,605 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:30:46,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 15:30:46,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1906852389, now seen corresponding path program 1 times [2022-04-28 15:30:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:46,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150965437] [2022-04-28 15:30:46,606 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 15:30:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1906852389, now seen corresponding path program 2 times [2022-04-28 15:30:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:46,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549708414] [2022-04-28 15:30:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:46,714 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:30:46,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 15:30:46,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-28 15:30:46,715 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:30:46,715 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:30:46,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {5905#true} assume true; {5905#true} is VALID [2022-04-28 15:30:46,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5905#true} {5905#true} #690#return; {5905#true} is VALID [2022-04-28 15:30:46,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {5905#true} call #t~ret161 := main(); {5905#true} is VALID [2022-04-28 15:30:46,716 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:30:46,716 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:30:46,716 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:30:46,719 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:30:46,719 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:30:46,720 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:30:46,720 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:30:46,721 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:30:46,721 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:30:46,722 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:30:46,722 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:30:46,722 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:30:46,723 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:30:46,723 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:30:46,723 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:30:46,724 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:30:46,724 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:30:46,725 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:30:46,725 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:30:46,725 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:30:46,725 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:30:46,725 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:30:46,726 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:30:46,726 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:30:46,726 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:30:46,726 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:30:46,726 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:30:46,726 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:30:46,726 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:30:46,726 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:30:46,727 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:30:46,727 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:30:46,728 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:30:46,728 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:30:46,728 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:30:46,728 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:30:46,728 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:30:46,728 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:30:46,728 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:30:46,728 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:30:46,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {5906#false} assume 8641 == #t~mem76;havoc #t~mem76; {5906#false} is VALID [2022-04-28 15:30:46,728 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:30:46,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {5906#false} assume 4 == ~blastFlag~0; {5906#false} is VALID [2022-04-28 15:30:46,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {5906#false} assume !false; {5906#false} is VALID [2022-04-28 15:30:46,729 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:30:46,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549708414] [2022-04-28 15:30:46,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549708414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:46,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:46,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:46,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:46,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150965437] [2022-04-28 15:30:46,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150965437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:46,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:46,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015536387] [2022-04-28 15:30:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:46,730 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:30:46,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:46,731 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:30:46,768 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:30:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:46,769 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:30:51,815 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:30:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:57,053 INFO L93 Difference]: Finished difference Result 491 states and 798 transitions. [2022-04-28 15:30:57,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:30:57,053 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:30:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:30:57,054 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:30:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:30:57,056 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:30:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 452 transitions. [2022-04-28 15:30:57,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 452 transitions. [2022-04-28 15:30:57,355 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:30:57,359 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:30:57,359 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:30:57,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:57,360 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:30:57,361 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:30:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:30:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:30:57,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:30:57,376 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:30:57,378 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:30:57,380 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:30:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:57,384 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:30:57,384 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:30:57,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:57,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:57,385 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:30:57,385 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:30:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:30:57,390 INFO L93 Difference]: Finished difference Result 267 states and 428 transitions. [2022-04-28 15:30:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 428 transitions. [2022-04-28 15:30:57,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:30:57,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:30:57,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:30:57,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:30:57,391 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:30:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2022-04-28 15:30:57,395 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 49 [2022-04-28 15:30:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:30:57,395 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2022-04-28 15:30:57,395 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:30:57,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 407 transitions. [2022-04-28 15:30:57,707 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:30:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2022-04-28 15:30:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 15:30:57,708 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:30:57,708 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:30:57,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 15:30:57,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:30:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:30:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1091716454, now seen corresponding path program 1 times [2022-04-28 15:30:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:57,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [214004295] [2022-04-28 15:30:57,728 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:30:57,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:30:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1091716454, now seen corresponding path program 2 times [2022-04-28 15:30:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:30:57,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297735624] [2022-04-28 15:30:57,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:30:57,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:30:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:30:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:30:57,902 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:30:57,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-28 15:30:57,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-28 15:30:57,903 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:30:57,904 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:30:57,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {7933#true} assume true; {7933#true} is VALID [2022-04-28 15:30:57,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7933#true} {7933#true} #690#return; {7933#true} is VALID [2022-04-28 15:30:57,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {7933#true} call #t~ret161 := main(); {7933#true} is VALID [2022-04-28 15:30:57,906 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:30:57,907 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:30:57,907 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:30:57,909 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:30:57,909 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:30:57,910 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:30:57,910 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:30:57,910 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:30:57,911 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:30:57,911 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:30:57,911 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:30:57,912 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:30:57,912 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:30:57,913 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:30:57,913 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:30:57,913 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:30:57,914 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:30:57,914 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:30:57,914 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:30:57,914 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:30:57,914 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:30:57,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {7934#false} ~skip~0 := 0; {7934#false} is VALID [2022-04-28 15:30:57,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-28 15:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,915 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,916 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:30:57,917 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:30:57,917 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:30:57,917 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:30:57,917 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:30:57,917 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:30:57,919 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:30:57,921 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:30:57,925 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:30:57,926 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:30:57,926 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:30:57,927 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:30:57,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {7934#false} assume 8641 == #t~mem76;havoc #t~mem76; {7934#false} is VALID [2022-04-28 15:30:57,928 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:30:57,929 INFO L290 TraceCheckUtils]: 60: Hoare triple {7934#false} assume 4 == ~blastFlag~0; {7934#false} is VALID [2022-04-28 15:30:57,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {7934#false} assume !false; {7934#false} is VALID [2022-04-28 15:30:57,929 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:30:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:30:57,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297735624] [2022-04-28 15:30:57,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297735624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:57,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:57,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:57,930 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:30:57,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [214004295] [2022-04-28 15:30:57,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [214004295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:30:57,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:30:57,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:30:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575322002] [2022-04-28 15:30:57,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:30:57,930 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:30:57,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:30:57,931 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:30:57,971 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:30:57,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:30:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:30:57,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:30:57,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:30:57,972 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:31:03,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:06,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:07,254 INFO L93 Difference]: Finished difference Result 491 states and 797 transitions. [2022-04-28 15:31:07,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:07,254 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:31:07,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:07,254 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:31:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:31:07,257 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:31:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 451 transitions. [2022-04-28 15:31:07,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 451 transitions. [2022-04-28 15:31:07,563 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:31:07,568 INFO L225 Difference]: With dead ends: 491 [2022-04-28 15:31:07,568 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 15:31:07,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:07,569 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 24 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:07,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 483 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 363 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:31:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 15:31:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 250. [2022-04-28 15:31:07,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:07,577 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:31:07,577 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:31:07,578 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:31:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:07,582 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:31:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:31:07,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:07,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:07,583 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:31:07,583 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:31:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:07,587 INFO L93 Difference]: Finished difference Result 267 states and 427 transitions. [2022-04-28 15:31:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 427 transitions. [2022-04-28 15:31:07,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:07,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:07,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:07,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:07,588 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:31:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 406 transitions. [2022-04-28 15:31:07,592 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 406 transitions. Word has length 62 [2022-04-28 15:31:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:07,592 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 406 transitions. [2022-04-28 15:31:07,592 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:31:07,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 406 transitions. [2022-04-28 15:31:07,875 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:31:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 406 transitions. [2022-04-28 15:31:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:31:07,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:07,876 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:31:07,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 15:31:07,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:07,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1864201878, now seen corresponding path program 1 times [2022-04-28 15:31:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:07,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1210448775] [2022-04-28 15:31:07,895 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:07,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1864201878, now seen corresponding path program 2 times [2022-04-28 15:31:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680932769] [2022-04-28 15:31:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:08,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:08,048 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:31:08,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-28 15:31:08,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-28 15:31:08,049 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:31:08,049 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:31:08,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {9961#true} assume true; {9961#true} is VALID [2022-04-28 15:31:08,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9961#true} {9961#true} #690#return; {9961#true} is VALID [2022-04-28 15:31:08,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {9961#true} call #t~ret161 := main(); {9961#true} is VALID [2022-04-28 15:31:08,049 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:31:08,049 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:31:08,049 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:31:08,051 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:31:08,052 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:31:08,052 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:31:08,053 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:31:08,053 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:31:08,054 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:31:08,054 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:31:08,054 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,055 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:31:08,056 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:31:08,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {9962#false} ~skip~0 := 0; {9962#false} is VALID [2022-04-28 15:31:08,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-28 15:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,056 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,057 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:31:08,058 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:31:08,058 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:31:08,058 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:31:08,058 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:31:08,058 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:31:08,058 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:31:08,058 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:31:08,058 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:31:08,058 INFO L290 TraceCheckUtils]: 59: Hoare triple {9962#false} assume 8641 == #t~mem76;havoc #t~mem76; {9962#false} is VALID [2022-04-28 15:31:08,058 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:31:08,058 INFO L290 TraceCheckUtils]: 61: Hoare triple {9962#false} assume 4 == ~blastFlag~0; {9962#false} is VALID [2022-04-28 15:31:08,058 INFO L290 TraceCheckUtils]: 62: Hoare triple {9962#false} assume !false; {9962#false} is VALID [2022-04-28 15:31:08,059 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:31:08,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:08,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680932769] [2022-04-28 15:31:08,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680932769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:08,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:08,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:08,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:08,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1210448775] [2022-04-28 15:31:08,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1210448775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:08,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:08,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:08,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112692992] [2022-04-28 15:31:08,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:08,060 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:31:08,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:08,060 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:31:08,108 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:31:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:08,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:08,109 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:31:10,128 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:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:11,271 INFO L93 Difference]: Finished difference Result 563 states and 907 transitions. [2022-04-28 15:31:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:11,271 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:31:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:11,271 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:31:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 15:31:11,295 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:31:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 15:31:11,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 15:31:11,700 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:31:11,705 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:31:11,705 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:31:11,706 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:11,706 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 151 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:11,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 346 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:31:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:31:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:31:11,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:11,715 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:31:11,715 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:31:11,715 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:31:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:11,721 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-28 15:31:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-28 15:31:11,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:11,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:11,722 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:31:11,722 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:31:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:11,727 INFO L93 Difference]: Finished difference Result 339 states and 534 transitions. [2022-04-28 15:31:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 534 transitions. [2022-04-28 15:31:11,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:11,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:11,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:11,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:11,728 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:31:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 402 transitions. [2022-04-28 15:31:11,732 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 402 transitions. Word has length 63 [2022-04-28 15:31:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:11,732 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 402 transitions. [2022-04-28 15:31:11,732 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:31:11,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 402 transitions. [2022-04-28 15:31:12,016 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:31:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 402 transitions. [2022-04-28 15:31:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:31:12,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:12,017 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:31:12,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 15:31:12,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1383254614, now seen corresponding path program 1 times [2022-04-28 15:31:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:12,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020664960] [2022-04-28 15:31:12,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:31:12,041 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1383254614, now seen corresponding path program 2 times [2022-04-28 15:31:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:12,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825681110] [2022-04-28 15:31:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:12,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:12,199 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:31:12,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-28 15:31:12,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-28 15:31:12,200 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:31:12,200 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:31:12,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {12277#true} assume true; {12277#true} is VALID [2022-04-28 15:31:12,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12277#true} {12277#true} #690#return; {12277#true} is VALID [2022-04-28 15:31:12,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {12277#true} call #t~ret161 := main(); {12277#true} is VALID [2022-04-28 15:31:12,200 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:31:12,200 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:31:12,200 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:31:12,202 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:31:12,203 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:31:12,204 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:31:12,206 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:31:12,207 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:31:12,207 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:31:12,208 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:31:12,208 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:31:12,208 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 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:31:12,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {12278#false} ~skip~0 := 0; {12278#false} is VALID [2022-04-28 15:31:12,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-28 15:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,210 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:31:12,211 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:31:12,211 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:31:12,211 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:31:12,211 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:31:12,211 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:31:12,211 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:31:12,213 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:31:12,214 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:31:12,215 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:31:12,215 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:31:12,215 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:31:12,215 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:31:12,215 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:31:12,215 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:31:12,215 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:31:12,216 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:31:12,216 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:31:12,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {12278#false} assume 8641 == #t~mem76;havoc #t~mem76; {12278#false} is VALID [2022-04-28 15:31:12,216 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:31:12,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {12278#false} assume 4 == ~blastFlag~0; {12278#false} is VALID [2022-04-28 15:31:12,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {12278#false} assume !false; {12278#false} is VALID [2022-04-28 15:31:12,217 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:31:12,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:12,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825681110] [2022-04-28 15:31:12,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825681110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:12,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:12,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020664960] [2022-04-28 15:31:12,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020664960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:12,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:12,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:12,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77216500] [2022-04-28 15:31:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:12,219 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:31:12,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:12,219 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:31:12,269 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:31:12,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:12,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:12,270 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:31:13,863 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:17,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:22,809 INFO L93 Difference]: Finished difference Result 563 states and 900 transitions. [2022-04-28 15:31:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:22,809 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:31:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:22,809 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:31:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 15:31:22,812 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:31:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 15:31:22,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-28 15:31:23,228 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:31:23,233 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:31:23,233 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:31:23,233 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:23,234 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:23,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:31:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:31:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:31:23,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:23,243 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:31:23,243 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:31:23,244 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:31:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:23,249 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-28 15:31:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-28 15:31:23,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:23,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:23,250 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:31:23,250 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:31:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:23,256 INFO L93 Difference]: Finished difference Result 339 states and 530 transitions. [2022-04-28 15:31:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 530 transitions. [2022-04-28 15:31:23,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:23,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:23,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:23,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:23,257 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:31:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2022-04-28 15:31:23,261 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 63 [2022-04-28 15:31:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:23,261 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2022-04-28 15:31:23,261 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:31:23,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 398 transitions. [2022-04-28 15:31:23,483 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:31:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2022-04-28 15:31:23,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:31:23,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:23,484 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:31:23,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 15:31:23,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:23,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:23,485 INFO L85 PathProgramCache]: Analyzing trace with hash -243345409, now seen corresponding path program 1 times [2022-04-28 15:31:23,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:23,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670894334] [2022-04-28 15:31:23,496 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:23,496 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -243345409, now seen corresponding path program 2 times [2022-04-28 15:31:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:23,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644911057] [2022-04-28 15:31:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:23,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:23,620 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:31:23,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-28 15:31:23,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-28 15:31:23,620 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:31:23,621 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:31:23,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {14593#true} assume true; {14593#true} is VALID [2022-04-28 15:31:23,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14593#true} {14593#true} #690#return; {14593#true} is VALID [2022-04-28 15:31:23,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {14593#true} call #t~ret161 := main(); {14593#true} is VALID [2022-04-28 15:31:23,621 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:31:23,621 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:31:23,621 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:31:23,623 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:31:23,623 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:31:23,624 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:31:23,624 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:31:23,625 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:31:23,625 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:31:23,625 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:31:23,626 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:31:23,626 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:31:23,626 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:31:23,627 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:31:23,627 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:31:23,628 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:31:23,628 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:31:23,628 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:31:23,628 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:31:23,628 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:31:23,629 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:31:23,629 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:31:23,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {14594#false} ~skip~0 := 0; {14594#false} is VALID [2022-04-28 15:31:23,629 INFO L290 TraceCheckUtils]: 28: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-28 15:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,629 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,630 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:31:23,631 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:31:23,631 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:31:23,631 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:31:23,631 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:31:23,631 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:31:23,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {14594#false} assume 8641 == #t~mem76;havoc #t~mem76; {14594#false} is VALID [2022-04-28 15:31:23,631 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:31:23,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {14594#false} assume 4 == ~blastFlag~0; {14594#false} is VALID [2022-04-28 15:31:23,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {14594#false} assume !false; {14594#false} is VALID [2022-04-28 15:31:23,631 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:31:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:23,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644911057] [2022-04-28 15:31:23,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644911057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:23,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:23,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:23,632 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:23,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670894334] [2022-04-28 15:31:23,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670894334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:23,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:23,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966938911] [2022-04-28 15:31:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:23,633 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:31:23,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:23,633 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:31:23,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:23,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:23,678 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:31:31,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:34,527 INFO L93 Difference]: Finished difference Result 488 states and 779 transitions. [2022-04-28 15:31:34,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:34,528 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:31:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:34,528 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:31:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:31:34,530 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:31:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 445 transitions. [2022-04-28 15:31:34,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 445 transitions. [2022-04-28 15:31:34,815 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:31:34,819 INFO L225 Difference]: With dead ends: 488 [2022-04-28 15:31:34,819 INFO L226 Difference]: Without dead ends: 264 [2022-04-28 15:31:34,820 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:34,820 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:34,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 15:31:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-04-28 15:31:34,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2022-04-28 15:31:34,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:34,827 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:31:34,828 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:31:34,828 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:31:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:34,832 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:31:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:31:34,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:34,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:34,833 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:31:34,834 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:31:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:34,837 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2022-04-28 15:31:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 415 transitions. [2022-04-28 15:31:34,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:34,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:34,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:34,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:34,838 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:31:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 397 transitions. [2022-04-28 15:31:34,855 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 397 transitions. Word has length 63 [2022-04-28 15:31:34,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:34,855 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 397 transitions. [2022-04-28 15:31:34,856 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:31:34,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 397 transitions. [2022-04-28 15:31:35,148 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:31:35,149 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 397 transitions. [2022-04-28 15:31:35,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 15:31:35,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:35,149 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:31:35,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 15:31:35,149 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash -102618722, now seen corresponding path program 1 times [2022-04-28 15:31:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:35,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731677817] [2022-04-28 15:31:35,161 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:31:35,161 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:35,161 INFO L85 PathProgramCache]: Analyzing trace with hash -102618722, now seen corresponding path program 2 times [2022-04-28 15:31:35,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:35,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797861858] [2022-04-28 15:31:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:35,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:35,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:35,316 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:31:35,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-28 15:31:35,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-28 15:31:35,317 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:31:35,317 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:31:35,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {16609#true} assume true; {16609#true} is VALID [2022-04-28 15:31:35,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16609#true} {16609#true} #690#return; {16609#true} is VALID [2022-04-28 15:31:35,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {16609#true} call #t~ret161 := main(); {16609#true} is VALID [2022-04-28 15:31:35,317 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:31:35,318 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:31:35,318 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:31:35,320 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:31:35,321 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:31:35,321 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:31:35,322 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:31:35,322 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:31:35,323 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:31:35,323 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:31:35,323 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:31:35,324 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:31:35,324 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:31:35,325 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:31:35,325 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:31:35,326 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:31:35,326 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:31:35,326 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:31:35,327 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:31:35,327 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:31:35,327 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:31:35,327 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:31:35,327 INFO L290 TraceCheckUtils]: 27: Hoare triple {16610#false} ~skip~0 := 0; {16610#false} is VALID [2022-04-28 15:31:35,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-28 15:31:35,327 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:31:35,327 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:31:35,327 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,328 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 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:31:35,329 INFO L290 TraceCheckUtils]: 59: Hoare triple {16610#false} assume 8641 == #t~mem76;havoc #t~mem76; {16610#false} is VALID [2022-04-28 15:31:35,330 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:31:35,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {16610#false} assume 4 == ~blastFlag~0; {16610#false} is VALID [2022-04-28 15:31:35,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {16610#false} assume !false; {16610#false} is VALID [2022-04-28 15:31:35,330 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:31:35,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:35,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797861858] [2022-04-28 15:31:35,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797861858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:35,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:35,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:35,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:35,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731677817] [2022-04-28 15:31:35,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731677817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:35,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:35,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:35,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122534502] [2022-04-28 15:31:35,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:35,331 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:31:35,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:35,331 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:31:35,375 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:31:35,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:35,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:35,376 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:31:38,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:41,313 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:31:43,318 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:45,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:46,230 INFO L93 Difference]: Finished difference Result 487 states and 777 transitions. [2022-04-28 15:31:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:46,230 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:31:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:46,231 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:31:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:31:46,235 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:31:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2022-04-28 15:31:46,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 443 transitions. [2022-04-28 15:31:46,521 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:31:46,525 INFO L225 Difference]: With dead ends: 487 [2022-04-28 15:31:46,525 INFO L226 Difference]: Without dead ends: 263 [2022-04-28 15:31:46,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 15:31:46,526 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:46,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 15:31:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-28 15:31:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 250. [2022-04-28 15:31:46,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:46,533 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:31:46,534 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:31:46,534 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:31:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:46,539 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:31:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:31:46,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:46,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:46,539 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:31:46,540 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:31:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:46,544 INFO L93 Difference]: Finished difference Result 263 states and 413 transitions. [2022-04-28 15:31:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 413 transitions. [2022-04-28 15:31:46,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:46,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:46,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:46,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:46,545 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:31:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 396 transitions. [2022-04-28 15:31:46,549 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 396 transitions. Word has length 63 [2022-04-28 15:31:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:46,549 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 396 transitions. [2022-04-28 15:31:46,549 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:31:46,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 396 transitions. [2022-04-28 15:31:46,828 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:31:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 396 transitions. [2022-04-28 15:31:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 15:31:46,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:46,829 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:31:46,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 15:31:46,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash -16626991, now seen corresponding path program 1 times [2022-04-28 15:31:46,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:46,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005537207] [2022-04-28 15:31:46,844 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:31:46,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash -16626991, now seen corresponding path program 2 times [2022-04-28 15:31:46,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:46,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443822951] [2022-04-28 15:31:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:46,977 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:31:46,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-28 15:31:46,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-28 15:31:46,978 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:31:46,978 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:31:46,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {18621#true} assume true; {18621#true} is VALID [2022-04-28 15:31:46,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18621#true} {18621#true} #690#return; {18621#true} is VALID [2022-04-28 15:31:46,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {18621#true} call #t~ret161 := main(); {18621#true} is VALID [2022-04-28 15:31:46,978 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:31:46,978 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:31:46,978 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:31:46,980 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:31:46,980 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:31:46,981 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:31:46,981 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:31:46,982 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:31:46,982 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:31:46,982 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:31:46,983 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:31:46,983 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:31:46,983 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 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:31:46,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {18622#false} ~skip~0 := 0; {18622#false} is VALID [2022-04-28 15:31:46,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-28 15:31:46,984 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:31:46,984 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,985 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,986 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:31:46,987 INFO L290 TraceCheckUtils]: 60: Hoare triple {18622#false} assume 8641 == #t~mem76;havoc #t~mem76; {18622#false} is VALID [2022-04-28 15:31:46,987 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:31:46,987 INFO L290 TraceCheckUtils]: 62: Hoare triple {18622#false} assume 4 == ~blastFlag~0; {18622#false} is VALID [2022-04-28 15:31:46,987 INFO L290 TraceCheckUtils]: 63: Hoare triple {18622#false} assume !false; {18622#false} is VALID [2022-04-28 15:31:46,988 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:31:46,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:46,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443822951] [2022-04-28 15:31:46,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443822951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:46,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:46,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:46,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005537207] [2022-04-28 15:31:46,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005537207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:46,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415292335] [2022-04-28 15:31:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:46,989 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:31:46,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:46,989 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:31:47,036 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:31:47,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:47,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:47,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:47,037 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:31:49,038 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:31:53,673 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:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:54,898 INFO L93 Difference]: Finished difference Result 563 states and 891 transitions. [2022-04-28 15:31:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:31:54,898 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:31:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:31:54,898 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:31:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:31:54,902 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:31:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 15:31:54,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 15:31:55,309 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:31:55,314 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:31:55,315 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:31:55,315 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:55,316 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 147 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 15:31:55,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 15:31:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:31:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:31:55,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:31:55,324 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:31:55,325 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:31:55,326 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:31:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:55,331 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-28 15:31:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-28 15:31:55,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:55,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:55,332 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:31:55,332 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:31:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:31:55,337 INFO L93 Difference]: Finished difference Result 339 states and 524 transitions. [2022-04-28 15:31:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 524 transitions. [2022-04-28 15:31:55,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:31:55,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:31:55,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:31:55,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:31:55,339 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:31:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2022-04-28 15:31:55,342 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 64 [2022-04-28 15:31:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:31:55,342 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2022-04-28 15:31:55,342 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:31:55,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 392 transitions. [2022-04-28 15:31:55,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:31:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2022-04-28 15:31:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 15:31:55,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:31:55,564 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:31:55,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 15:31:55,564 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:31:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:31:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2085052975, now seen corresponding path program 1 times [2022-04-28 15:31:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:55,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963037679] [2022-04-28 15:31:55,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:31:55,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:31:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2085052975, now seen corresponding path program 2 times [2022-04-28 15:31:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:31:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474896723] [2022-04-28 15:31:55,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:31:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:31:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:31:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:31:55,712 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:31:55,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-28 15:31:55,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-28 15:31:55,713 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:31:55,714 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:31:55,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {20937#true} assume true; {20937#true} is VALID [2022-04-28 15:31:55,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20937#true} {20937#true} #690#return; {20937#true} is VALID [2022-04-28 15:31:55,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {20937#true} call #t~ret161 := main(); {20937#true} is VALID [2022-04-28 15:31:55,714 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:31:55,714 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:31:55,714 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:31:55,716 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:31:55,716 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:31:55,717 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:31:55,717 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:31:55,717 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:31:55,718 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:31:55,718 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:31:55,718 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:31:55,719 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:31:55,719 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:31:55,719 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 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:31:55,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {20938#false} ~skip~0 := 0; {20938#false} is VALID [2022-04-28 15:31:55,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-28 15:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,721 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,722 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:31:55,723 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:31:55,723 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:31:55,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {20938#false} assume 8641 == #t~mem76;havoc #t~mem76; {20938#false} is VALID [2022-04-28 15:31:55,723 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:31:55,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {20938#false} assume 4 == ~blastFlag~0; {20938#false} is VALID [2022-04-28 15:31:55,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {20938#false} assume !false; {20938#false} is VALID [2022-04-28 15:31:55,723 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:31:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:31:55,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474896723] [2022-04-28 15:31:55,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474896723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:55,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:55,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:55,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:31:55,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1963037679] [2022-04-28 15:31:55,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1963037679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:31:55,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:31:55,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:31:55,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464591315] [2022-04-28 15:31:55,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:31:55,724 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:31:55,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:31:55,725 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:31:55,771 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:31:55,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:31:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:31:55,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:31:55,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:31:55,772 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:32:02,755 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:32:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:05,441 INFO L93 Difference]: Finished difference Result 563 states and 884 transitions. [2022-04-28 15:32:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:05,442 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:32:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:05,442 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:32:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 15:32:05,446 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:32:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2022-04-28 15:32:05,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 592 transitions. [2022-04-28 15:32:06,058 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:32:06,063 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:32:06,064 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:32:06,064 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:32:06,064 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 145 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:06,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 346 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 15:32:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:32:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2022-04-28 15:32:06,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:06,074 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:32:06,075 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:32:06,075 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:32:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:06,080 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-28 15:32:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-28 15:32:06,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:06,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:06,081 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:32:06,081 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:32:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:06,087 INFO L93 Difference]: Finished difference Result 339 states and 520 transitions. [2022-04-28 15:32:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2022-04-28 15:32:06,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:06,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:06,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:06,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:06,088 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:32:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2022-04-28 15:32:06,091 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 65 [2022-04-28 15:32:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:06,091 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2022-04-28 15:32:06,092 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:32:06,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 388 transitions. [2022-04-28 15:32:06,379 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:32:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2022-04-28 15:32:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:32:06,380 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:06,380 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:32:06,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 15:32:06,380 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash 891449068, now seen corresponding path program 1 times [2022-04-28 15:32:06,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:06,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941348655] [2022-04-28 15:32:06,405 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 15:32:06,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash 891449068, now seen corresponding path program 2 times [2022-04-28 15:32:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:06,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063722955] [2022-04-28 15:32:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:06,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:06,519 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:32:06,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-28 15:32:06,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-28 15:32:06,519 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:32:06,520 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:32:06,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {23253#true} assume true; {23253#true} is VALID [2022-04-28 15:32:06,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23253#true} {23253#true} #690#return; {23253#true} is VALID [2022-04-28 15:32:06,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {23253#true} call #t~ret161 := main(); {23253#true} is VALID [2022-04-28 15:32:06,520 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:32:06,520 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:32:06,520 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:32:06,522 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:32:06,522 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:32:06,523 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:32:06,523 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:32:06,523 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:32:06,524 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:32:06,524 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:32:06,524 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:32:06,525 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:32:06,527 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:32:06,539 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:32:06,540 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:32:06,540 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:32:06,540 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:32:06,540 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {23254#false} ~skip~0 := 0; {23254#false} is VALID [2022-04-28 15:32:06,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-28 15:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,541 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,542 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:32:06,560 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:32:06,560 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:32:06,560 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:32:06,560 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:32:06,560 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:32:06,560 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 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:32:06,561 INFO L290 TraceCheckUtils]: 62: Hoare triple {23254#false} assume 8641 == #t~mem76;havoc #t~mem76; {23254#false} is VALID [2022-04-28 15:32:06,561 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:32:06,561 INFO L290 TraceCheckUtils]: 64: Hoare triple {23254#false} assume 4 == ~blastFlag~0; {23254#false} is VALID [2022-04-28 15:32:06,561 INFO L290 TraceCheckUtils]: 65: Hoare triple {23254#false} assume !false; {23254#false} is VALID [2022-04-28 15:32:06,562 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:32:06,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:06,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063722955] [2022-04-28 15:32:06,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063722955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:06,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:06,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:06,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:06,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941348655] [2022-04-28 15:32:06,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941348655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:06,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:06,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15376391] [2022-04-28 15:32:06,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:06,563 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:32:06,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:06,563 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:32:06,625 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:32:06,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:06,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:06,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:06,627 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:32:11,571 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:32:15,500 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:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:16,322 INFO L93 Difference]: Finished difference Result 477 states and 749 transitions. [2022-04-28 15:32:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:16,322 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:32:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:16,323 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:32:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:32:16,324 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:32:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2022-04-28 15:32:16,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 427 transitions. [2022-04-28 15:32:16,576 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:32:16,579 INFO L225 Difference]: With dead ends: 477 [2022-04-28 15:32:16,579 INFO L226 Difference]: Without dead ends: 253 [2022-04-28 15:32:16,580 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:32:16,580 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:16,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:32:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-28 15:32:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2022-04-28 15:32:16,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:16,597 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:32:16,597 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:32:16,598 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:32:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:16,637 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:32:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:32:16,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:16,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:16,641 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:32:16,643 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:32:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:16,647 INFO L93 Difference]: Finished difference Result 253 states and 391 transitions. [2022-04-28 15:32:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2022-04-28 15:32:16,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:16,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:16,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:16,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:16,648 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:32:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2022-04-28 15:32:16,652 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 66 [2022-04-28 15:32:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:16,652 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2022-04-28 15:32:16,652 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:32:16,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 387 transitions. [2022-04-28 15:32:16,964 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:32:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2022-04-28 15:32:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 15:32:16,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:16,965 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:32:16,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 15:32:16,965 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1688521123, now seen corresponding path program 1 times [2022-04-28 15:32:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:16,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866240782] [2022-04-28 15:32:16,997 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:16,997 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1688521123, now seen corresponding path program 2 times [2022-04-28 15:32:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:16,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744588428] [2022-04-28 15:32:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:16,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:17,176 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:32:17,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-28 15:32:17,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-28 15:32:17,182 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:32:17,183 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:32:17,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {25225#true} assume true; {25225#true} is VALID [2022-04-28 15:32:17,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25225#true} {25225#true} #690#return; {25225#true} is VALID [2022-04-28 15:32:17,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {25225#true} call #t~ret161 := main(); {25225#true} is VALID [2022-04-28 15:32:17,183 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:32:17,183 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:32:17,183 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:32:17,183 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:32:17,184 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:32:17,184 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:32:17,184 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:32:17,184 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:32:17,184 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:32:17,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {25225#true} assume !false; {25225#true} is VALID [2022-04-28 15:32:17,184 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:32:17,184 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:32:17,184 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:32:17,184 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:32:17,185 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:32:17,185 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:32:17,185 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:32:17,185 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:32:17,185 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:32:17,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {25225#true} assume 8464 == #t~mem55;havoc #t~mem55; {25225#true} is VALID [2022-04-28 15:32:17,185 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:32:17,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {25225#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25225#true} is VALID [2022-04-28 15:32:17,186 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:32:17,186 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:32:17,187 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:32:17,187 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:32:17,187 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:32:17,188 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:32:17,203 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:32:17,204 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:32:17,204 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:32:17,205 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:32:17,205 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:32:17,205 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:32:17,206 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:32:17,206 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:32:17,206 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:32:17,207 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:32:17,207 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:32:17,207 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:32:17,208 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:32:17,208 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:32:17,208 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:32:17,209 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:32:17,209 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:32:17,209 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:32:17,210 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:32:17,210 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:32:17,210 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:32:17,211 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:32:17,211 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:32:17,212 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:32:17,212 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:32:17,212 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:32:17,213 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:32:17,213 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:32:17,213 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:32:17,214 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:32:17,214 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:32:17,214 INFO L290 TraceCheckUtils]: 64: Hoare triple {25226#false} assume 4 == ~blastFlag~0; {25226#false} is VALID [2022-04-28 15:32:17,214 INFO L290 TraceCheckUtils]: 65: Hoare triple {25226#false} assume !false; {25226#false} is VALID [2022-04-28 15:32:17,214 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:32:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:17,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744588428] [2022-04-28 15:32:17,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744588428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:17,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:17,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:17,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:17,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866240782] [2022-04-28 15:32:17,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866240782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:17,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:17,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652574245] [2022-04-28 15:32:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:17,216 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:32:17,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:17,216 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:32:17,278 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:32:17,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:17,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:17,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:17,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:17,278 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:32:19,313 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:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:20,496 INFO L93 Difference]: Finished difference Result 563 states and 876 transitions. [2022-04-28 15:32:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:20,496 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:32:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:20,496 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:32:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:32:20,498 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:32:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-04-28 15:32:20,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 591 transitions. [2022-04-28 15:32:20,897 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:32:20,902 INFO L225 Difference]: With dead ends: 563 [2022-04-28 15:32:20,902 INFO L226 Difference]: Without dead ends: 339 [2022-04-28 15:32:20,903 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:32:20,905 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 119 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 358 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 15:32:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-28 15:32:20,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 261. [2022-04-28 15:32:20,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:20,918 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:32:20,918 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:32:20,918 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:32:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:20,923 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-28 15:32:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-28 15:32:20,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:20,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:20,924 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:32:20,924 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:32:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:20,929 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2022-04-28 15:32:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 518 transitions. [2022-04-28 15:32:20,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:20,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:20,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:20,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:20,930 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:32:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 408 transitions. [2022-04-28 15:32:20,941 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 408 transitions. Word has length 66 [2022-04-28 15:32:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:20,942 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 408 transitions. [2022-04-28 15:32:20,942 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:32:20,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 261 states and 408 transitions. [2022-04-28 15:32:21,245 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:32:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 408 transitions. [2022-04-28 15:32:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 15:32:21,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:21,246 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:32:21,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 15:32:21,247 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 1 times [2022-04-28 15:32:21,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:21,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042736457] [2022-04-28 15:32:21,305 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:21,305 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1127555326, now seen corresponding path program 2 times [2022-04-28 15:32:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:21,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300767108] [2022-04-28 15:32:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:21,417 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:32:21,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-28 15:32:21,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-28 15:32:21,418 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:32:21,418 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:32:21,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {27563#true} assume true; {27563#true} is VALID [2022-04-28 15:32:21,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27563#true} {27563#true} #690#return; {27563#true} is VALID [2022-04-28 15:32:21,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {27563#true} call #t~ret161 := main(); {27563#true} is VALID [2022-04-28 15:32:21,418 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:32:21,418 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:32:21,418 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:32:21,418 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:32:21,418 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:32:21,418 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:32:21,418 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:32:21,418 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:32:21,419 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:32:21,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {27563#true} assume !false; {27563#true} is VALID [2022-04-28 15:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 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:32:21,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {27563#true} assume 8464 == #t~mem55;havoc #t~mem55; {27563#true} is VALID [2022-04-28 15:32:21,419 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:32:21,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {27563#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {27563#true} is VALID [2022-04-28 15:32:21,420 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:32:21,421 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:32:21,421 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:32:21,421 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:32:21,422 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:32:21,422 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:32:21,422 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:32:21,423 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:32:21,423 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:32:21,423 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:32:21,424 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:32:21,424 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:32:21,424 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:32:21,425 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:32:21,425 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:32:21,425 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:32:21,426 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:32:21,426 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:32:21,426 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:32:21,427 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:32:21,427 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:32:21,427 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:32:21,427 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:32:21,428 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:32:21,428 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:32:21,428 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:32:21,428 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:32:21,428 INFO L290 TraceCheckUtils]: 54: Hoare triple {27564#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {27564#false} is VALID [2022-04-28 15:32:21,428 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:32:21,428 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:32:21,428 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:32:21,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {27564#false} ~skip~0 := 0; {27564#false} is VALID [2022-04-28 15:32:21,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-28 15:32:21,428 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:32:21,428 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,429 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:32:21,430 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:32:21,430 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:32:21,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {27564#false} assume 8544 == #t~mem64;havoc #t~mem64; {27564#false} is VALID [2022-04-28 15:32:21,430 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:32:21,430 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:32:21,430 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:32:21,430 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:32:21,430 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:32:21,430 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:32:21,430 INFO L290 TraceCheckUtils]: 85: Hoare triple {27564#false} assume 8 == ~blastFlag~0; {27564#false} is VALID [2022-04-28 15:32:21,430 INFO L290 TraceCheckUtils]: 86: Hoare triple {27564#false} assume !false; {27564#false} is VALID [2022-04-28 15:32:21,431 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:32:21,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:21,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300767108] [2022-04-28 15:32:21,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300767108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:21,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:21,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:21,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:21,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2042736457] [2022-04-28 15:32:21,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2042736457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:21,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:21,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:21,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901022419] [2022-04-28 15:32:21,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:21,432 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:32:21,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:21,432 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:32:21,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:32:21,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:21,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:21,492 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:32:26,356 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,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:31,307 INFO L93 Difference]: Finished difference Result 614 states and 963 transitions. [2022-04-28 15:32:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:31,308 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:32:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:31,308 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:32:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:32:31,310 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:32:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:32:31,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:32:31,727 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:32:31,733 INFO L225 Difference]: With dead ends: 614 [2022-04-28 15:32:31,734 INFO L226 Difference]: Without dead ends: 379 [2022-04-28 15:32:31,734 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:32:31,734 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 132 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 4.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:31,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 358 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-28 15:32:31,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-28 15:32:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 287. [2022-04-28 15:32:31,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:31,751 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:32:31,751 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:32:31,752 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:32:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:31,757 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-28 15:32:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-28 15:32:31,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:31,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:31,759 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:32:31,759 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:32:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:31,765 INFO L93 Difference]: Finished difference Result 379 states and 582 transitions. [2022-04-28 15:32:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 582 transitions. [2022-04-28 15:32:31,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:31,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:31,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:31,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:31,765 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:32:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 448 transitions. [2022-04-28 15:32:31,769 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 448 transitions. Word has length 87 [2022-04-28 15:32:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:31,770 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 448 transitions. [2022-04-28 15:32:31,770 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:32:31,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 448 transitions. [2022-04-28 15:32:32,115 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:32:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 448 transitions. [2022-04-28 15:32:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:32:32,116 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:32,116 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:32:32,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 15:32:32,116 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 1 times [2022-04-28 15:32:32,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:32,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480608531] [2022-04-28 15:32:32,172 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:32,173 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:32,173 INFO L85 PathProgramCache]: Analyzing trace with hash 684844099, now seen corresponding path program 2 times [2022-04-28 15:32:32,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:32,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927923639] [2022-04-28 15:32:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:32,276 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:32:32,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-28 15:32:32,276 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-28 15:32:32,277 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:32:32,277 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:32:32,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {30135#true} assume true; {30135#true} is VALID [2022-04-28 15:32:32,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30135#true} {30135#true} #690#return; {30135#true} is VALID [2022-04-28 15:32:32,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {30135#true} call #t~ret161 := main(); {30135#true} is VALID [2022-04-28 15:32:32,277 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:32:32,277 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:32:32,277 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:32:32,277 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {30135#true} assume !false; {30135#true} is VALID [2022-04-28 15:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,278 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:32:32,279 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:32:32,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {30135#true} assume 8464 == #t~mem55;havoc #t~mem55; {30135#true} is VALID [2022-04-28 15:32:32,279 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:32:32,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {30135#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30135#true} is VALID [2022-04-28 15:32:32,280 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:32:32,280 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:32:32,280 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:32:32,281 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:32:32,281 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:32:32,281 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:32:32,282 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:32:32,282 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:32:32,282 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:32:32,282 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:32:32,283 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:32:32,283 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:32:32,283 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:32:32,284 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:32:32,284 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:32:32,284 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:32:32,285 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:32:32,285 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:32:32,285 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:32:32,286 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:32:32,286 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:32:32,286 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:32:32,287 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:32:32,287 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:32:32,287 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:32:32,287 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:32:32,287 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:32:32,287 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:32:32,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {30136#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {30136#false} is VALID [2022-04-28 15:32:32,287 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:32:32,287 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:32:32,287 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:32:32,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {30136#false} ~skip~0 := 0; {30136#false} is VALID [2022-04-28 15:32:32,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-28 15:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,288 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:32:32,289 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:32:32,289 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:32:32,289 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:32:32,289 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:32:32,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {30136#false} assume 8544 == #t~mem64;havoc #t~mem64; {30136#false} is VALID [2022-04-28 15:32:32,289 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:32:32,289 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:32:32,289 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:32:32,289 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:32:32,289 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:32:32,289 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:32:32,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {30136#false} assume 8 == ~blastFlag~0; {30136#false} is VALID [2022-04-28 15:32:32,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {30136#false} assume !false; {30136#false} is VALID [2022-04-28 15:32:32,290 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:32:32,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:32,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927923639] [2022-04-28 15:32:32,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927923639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:32,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:32,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:32,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:32,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480608531] [2022-04-28 15:32:32,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480608531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:32,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:32,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315867830] [2022-04-28 15:32:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:32,291 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:32:32,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:32,291 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:32:32,351 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:32:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:32,352 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:32:38,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:40,029 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:42,054 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:32:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:43,284 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2022-04-28 15:32:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:43,284 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:32:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:43,285 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:32:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:32:43,289 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:32:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-28 15:32:43,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-28 15:32:43,548 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:32:43,573 INFO L225 Difference]: With dead ends: 626 [2022-04-28 15:32:43,573 INFO L226 Difference]: Without dead ends: 365 [2022-04-28 15:32:43,575 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:32:43,576 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 131 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:43,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 498 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time] [2022-04-28 15:32:43,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-04-28 15:32:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2022-04-28 15:32:43,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:43,586 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:32:43,587 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:32:43,587 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:32:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:43,610 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-28 15:32:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-28 15:32:43,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:43,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:43,611 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:32:43,612 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:32:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:43,633 INFO L93 Difference]: Finished difference Result 365 states and 555 transitions. [2022-04-28 15:32:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2022-04-28 15:32:43,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:43,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:43,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:43,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:43,634 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:32:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 445 transitions. [2022-04-28 15:32:43,638 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 445 transitions. Word has length 88 [2022-04-28 15:32:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:43,639 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 445 transitions. [2022-04-28 15:32:43,639 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:32:43,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 287 states and 445 transitions. [2022-04-28 15:32:43,873 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:32:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 445 transitions. [2022-04-28 15:32:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 15:32:43,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:43,875 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:32:43,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 15:32:43,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:43,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 1 times [2022-04-28 15:32:43,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:43,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497167939] [2022-04-28 15:32:43,927 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:43,927 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1964115669, now seen corresponding path program 2 times [2022-04-28 15:32:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:43,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641969086] [2022-04-28 15:32:43,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:43,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:44,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:44,080 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:32:44,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-28 15:32:44,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-28 15:32:44,081 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:32:44,081 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:32:44,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {32703#true} assume true; {32703#true} is VALID [2022-04-28 15:32:44,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32703#true} {32703#true} #690#return; {32703#true} is VALID [2022-04-28 15:32:44,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {32703#true} call #t~ret161 := main(); {32703#true} is VALID [2022-04-28 15:32:44,081 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {32703#true} assume !false; {32703#true} is VALID [2022-04-28 15:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,082 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:32:44,083 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:32:44,083 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:32:44,083 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:32:44,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {32703#true} assume 8464 == #t~mem55;havoc #t~mem55; {32703#true} is VALID [2022-04-28 15:32:44,083 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:32:44,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {32703#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32703#true} is VALID [2022-04-28 15:32:44,084 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:32:44,084 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:32:44,084 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:32:44,085 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:32:44,085 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:32:44,085 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:32:44,086 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:32:44,086 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:32:44,087 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:32:44,087 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:32:44,087 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:32:44,088 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:32:44,088 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:32:44,088 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:32:44,089 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:32:44,089 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:32:44,089 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 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:32:44,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {32704#false} assume 8448 == #t~mem68;havoc #t~mem68; {32704#false} is VALID [2022-04-28 15:32:44,090 INFO L290 TraceCheckUtils]: 55: Hoare triple {32704#false} assume !(~num1~0 > 0); {32704#false} is VALID [2022-04-28 15:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {32704#false} ~skip~0 := 0; {32704#false} is VALID [2022-04-28 15:32:44,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-28 15:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 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:32:44,091 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 INFO L290 TraceCheckUtils]: 79: Hoare triple {32704#false} assume 8544 == #t~mem64;havoc #t~mem64; {32704#false} is VALID [2022-04-28 15:32:44,092 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:32:44,092 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:32:44,092 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:32:44,092 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:32:44,093 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:32:44,093 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:32:44,093 INFO L290 TraceCheckUtils]: 86: Hoare triple {32704#false} assume 8 == ~blastFlag~0; {32704#false} is VALID [2022-04-28 15:32:44,093 INFO L290 TraceCheckUtils]: 87: Hoare triple {32704#false} assume !false; {32704#false} is VALID [2022-04-28 15:32:44,093 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:32:44,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641969086] [2022-04-28 15:32:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641969086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:44,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:44,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:44,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:44,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497167939] [2022-04-28 15:32:44,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497167939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:44,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:44,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025787820] [2022-04-28 15:32:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:44,094 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:32:44,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:44,095 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:32:44,148 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:32:44,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:44,149 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:32:46,168 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:47,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:47,087 INFO L93 Difference]: Finished difference Result 590 states and 921 transitions. [2022-04-28 15:32:47,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:47,087 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:32:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:32:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:32:47,090 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:32:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 472 transitions. [2022-04-28 15:32:47,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 472 transitions. [2022-04-28 15:32:47,371 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:32:47,398 INFO L225 Difference]: With dead ends: 590 [2022-04-28 15:32:47,398 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:32:47,399 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:32:47,399 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:47,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 505 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 392 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:32:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:32:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:32:47,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:47,415 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:32:47,431 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:32:47,432 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:32:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:47,438 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:32:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:32:47,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:47,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:47,439 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:32:47,440 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:32:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:47,445 INFO L93 Difference]: Finished difference Result 329 states and 505 transitions. [2022-04-28 15:32:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2022-04-28 15:32:47,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:47,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:47,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:47,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:47,447 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:32:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 479 transitions. [2022-04-28 15:32:47,468 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 479 transitions. Word has length 88 [2022-04-28 15:32:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:47,468 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 479 transitions. [2022-04-28 15:32:47,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:32:47,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 479 transitions. [2022-04-28 15:32:47,815 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:32:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 479 transitions. [2022-04-28 15:32:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-28 15:32:47,817 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:47,817 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:32:47,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 15:32:47,818 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 1 times [2022-04-28 15:32:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:47,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133640772] [2022-04-28 15:32:47,869 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:47,869 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:47,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1847172772, now seen corresponding path program 2 times [2022-04-28 15:32:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:47,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126941118] [2022-04-28 15:32:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:48,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:48,074 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:32:48,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-28 15:32:48,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-28 15:32:48,075 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:32:48,075 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:32:48,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {35171#true} assume true; {35171#true} is VALID [2022-04-28 15:32:48,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35171#true} {35171#true} #690#return; {35171#true} is VALID [2022-04-28 15:32:48,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {35171#true} call #t~ret161 := main(); {35171#true} is VALID [2022-04-28 15:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 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:32:48,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {35171#true} assume !false; {35171#true} is VALID [2022-04-28 15:32:48,076 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:32:48,076 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:32:48,077 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:32:48,077 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:32:48,077 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:32:48,077 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:32:48,077 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:32:48,077 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:32:48,077 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:32:48,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {35171#true} assume 8464 == #t~mem55;havoc #t~mem55; {35171#true} is VALID [2022-04-28 15:32:48,077 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:32:48,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {35171#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {35171#true} is VALID [2022-04-28 15:32:48,078 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:32:48,078 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:32:48,079 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:32:48,079 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:32:48,079 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:32:48,080 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:32:48,080 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:32:48,080 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:32:48,081 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:32:48,081 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:32:48,082 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:32:48,082 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:32:48,082 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:32:48,082 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:32:48,082 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:32:48,082 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:32:48,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-28 15:32:48,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:32:48,082 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:32:48,082 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,083 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:32:48,084 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:32:48,084 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:32:48,084 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:32:48,084 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:32:48,084 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:32:48,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {35172#false} assume 8448 == #t~mem68;havoc #t~mem68; {35172#false} is VALID [2022-04-28 15:32:48,084 INFO L290 TraceCheckUtils]: 68: Hoare triple {35172#false} assume !(~num1~0 > 0); {35172#false} is VALID [2022-04-28 15:32:48,084 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:32:48,084 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:32:48,084 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:32:48,084 INFO L290 TraceCheckUtils]: 72: Hoare triple {35172#false} ~skip~0 := 0; {35172#false} is VALID [2022-04-28 15:32:48,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:32:48,084 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:32:48,084 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:32:48,084 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,085 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:32:48,086 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:32:48,086 INFO L290 TraceCheckUtils]: 92: Hoare triple {35172#false} assume 8544 == #t~mem64;havoc #t~mem64; {35172#false} is VALID [2022-04-28 15:32:48,086 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:32:48,086 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:32:48,086 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:32:48,086 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:32:48,086 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:32:48,086 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:32:48,086 INFO L290 TraceCheckUtils]: 99: Hoare triple {35172#false} assume 8 == ~blastFlag~0; {35172#false} is VALID [2022-04-28 15:32:48,086 INFO L290 TraceCheckUtils]: 100: Hoare triple {35172#false} assume !false; {35172#false} is VALID [2022-04-28 15:32:48,086 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:32:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126941118] [2022-04-28 15:32:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126941118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:48,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:48,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:48,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133640772] [2022-04-28 15:32:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133640772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:48,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:48,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457785048] [2022-04-28 15:32:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:48,088 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:32:48,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:48,088 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:32:48,173 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:32:48,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:48,174 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:32:49,699 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:32:51,703 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:55,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:32:57,782 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:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:58,741 INFO L93 Difference]: Finished difference Result 612 states and 954 transitions. [2022-04-28 15:32:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:32:58,741 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:32:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:32:58,741 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:32:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:32:58,743 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:32:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-28 15:32:58,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-28 15:32:59,042 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:32:59,047 INFO L225 Difference]: With dead ends: 612 [2022-04-28 15:32:59,047 INFO L226 Difference]: Without dead ends: 329 [2022-04-28 15:32:59,047 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:32:59,048 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:32:59,048 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.5s Time] [2022-04-28 15:32:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-28 15:32:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 309. [2022-04-28 15:32:59,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:32:59,081 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:32:59,081 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:32:59,081 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:32:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:59,086 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:32:59,086 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:32:59,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:59,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:59,099 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:32:59,100 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:32:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:32:59,107 INFO L93 Difference]: Finished difference Result 329 states and 504 transitions. [2022-04-28 15:32:59,107 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 504 transitions. [2022-04-28 15:32:59,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:32:59,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:32:59,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:32:59,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:32:59,108 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:32:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2022-04-28 15:32:59,112 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 101 [2022-04-28 15:32:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:32:59,112 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2022-04-28 15:32:59,112 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:32:59,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 478 transitions. [2022-04-28 15:32:59,497 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:32:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2022-04-28 15:32:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:32:59,498 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:32:59,498 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:32:59,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 15:32:59,498 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:32:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:32:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 1 times [2022-04-28 15:32:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:59,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1312618051] [2022-04-28 15:32:59,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:32:59,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:32:59,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1251719941, now seen corresponding path program 2 times [2022-04-28 15:32:59,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:32:59,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433270869] [2022-04-28 15:32:59,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:32:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:32:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:32:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:32:59,673 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:32:59,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-28 15:32:59,673 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-28 15:32:59,673 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:32:59,673 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:32:59,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {37683#true} assume true; {37683#true} is VALID [2022-04-28 15:32:59,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37683#true} {37683#true} #690#return; {37683#true} is VALID [2022-04-28 15:32:59,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {37683#true} call #t~ret161 := main(); {37683#true} is VALID [2022-04-28 15:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 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:32:59,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {37683#true} assume !false; {37683#true} is VALID [2022-04-28 15:32:59,674 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:32:59,675 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:32:59,675 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:32:59,675 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:32:59,675 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:32:59,675 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:32:59,675 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:32:59,675 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:32:59,675 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:32:59,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {37683#true} assume 8464 == #t~mem55;havoc #t~mem55; {37683#true} is VALID [2022-04-28 15:32:59,675 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:32:59,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {37683#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37683#true} is VALID [2022-04-28 15:32:59,676 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:32:59,676 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:32:59,677 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:32:59,677 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:32:59,677 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:32:59,678 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:32:59,678 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:32:59,678 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:32:59,679 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:32:59,679 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:32:59,679 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:32:59,680 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:32:59,680 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:32:59,680 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:32:59,680 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:32:59,680 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:32:59,680 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:32:59,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-28 15:32:59,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:32:59,680 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:32:59,680 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,681 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:32:59,682 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:32:59,682 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:32:59,682 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:32:59,682 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:32:59,682 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:32:59,682 INFO L290 TraceCheckUtils]: 68: Hoare triple {37684#false} assume 8448 == #t~mem68;havoc #t~mem68; {37684#false} is VALID [2022-04-28 15:32:59,682 INFO L290 TraceCheckUtils]: 69: Hoare triple {37684#false} assume !(~num1~0 > 0); {37684#false} is VALID [2022-04-28 15:32:59,682 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:32:59,682 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:32:59,682 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:32:59,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {37684#false} ~skip~0 := 0; {37684#false} is VALID [2022-04-28 15:32:59,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:32:59,682 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:32:59,682 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:32:59,682 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,683 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:32:59,684 INFO L290 TraceCheckUtils]: 93: Hoare triple {37684#false} assume 8544 == #t~mem64;havoc #t~mem64; {37684#false} is VALID [2022-04-28 15:32:59,684 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:32:59,684 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:32:59,684 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:32:59,684 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:32:59,684 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:32:59,684 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:32:59,684 INFO L290 TraceCheckUtils]: 100: Hoare triple {37684#false} assume 8 == ~blastFlag~0; {37684#false} is VALID [2022-04-28 15:32:59,684 INFO L290 TraceCheckUtils]: 101: Hoare triple {37684#false} assume !false; {37684#false} is VALID [2022-04-28 15:32:59,685 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:32:59,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:32:59,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433270869] [2022-04-28 15:32:59,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433270869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:59,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:59,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:59,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:32:59,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1312618051] [2022-04-28 15:32:59,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1312618051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:32:59,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:32:59,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:32:59,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161192715] [2022-04-28 15:32:59,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:32:59,686 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:32:59,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:32:59,687 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:32:59,736 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:32:59,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:32:59,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:32:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:32:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:32:59,737 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:33:01,757 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:33:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:02,841 INFO L93 Difference]: Finished difference Result 670 states and 1036 transitions. [2022-04-28 15:33:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:02,841 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:33:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:02,841 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:33:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:33:02,843 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:33:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-04-28 15:33:02,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 589 transitions. [2022-04-28 15:33:03,144 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:33:03,154 INFO L225 Difference]: With dead ends: 670 [2022-04-28 15:33:03,154 INFO L226 Difference]: Without dead ends: 387 [2022-04-28 15:33:03,155 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:33:03,156 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 140 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 57 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:03,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 394 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:33:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-28 15:33:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2022-04-28 15:33:03,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:03,200 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:33:03,200 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:33:03,201 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:33:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:03,206 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-28 15:33:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-28 15:33:03,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:03,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:03,207 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:33:03,208 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:33:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:03,225 INFO L93 Difference]: Finished difference Result 387 states and 583 transitions. [2022-04-28 15:33:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 583 transitions. [2022-04-28 15:33:03,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:03,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:03,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:03,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:03,227 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:33:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2022-04-28 15:33:03,231 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 102 [2022-04-28 15:33:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:03,231 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2022-04-28 15:33:03,231 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:33:03,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 473 transitions. [2022-04-28 15:33:03,506 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:33:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2022-04-28 15:33:03,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 15:33:03,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:03,507 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:33:03,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 15:33:03,507 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 1 times [2022-04-28 15:33:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1404774152] [2022-04-28 15:33:03,558 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:03,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1560968036, now seen corresponding path program 2 times [2022-04-28 15:33:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:03,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031367391] [2022-04-28 15:33:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:03,654 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:33:03,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-28 15:33:03,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-28 15:33:03,654 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:33:03,654 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:33:03,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {40427#true} assume true; {40427#true} is VALID [2022-04-28 15:33:03,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40427#true} {40427#true} #690#return; {40427#true} is VALID [2022-04-28 15:33:03,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {40427#true} call #t~ret161 := main(); {40427#true} is VALID [2022-04-28 15:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 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:33:03,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {40427#true} assume !false; {40427#true} is VALID [2022-04-28 15:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 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:33:03,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {40427#true} assume 8464 == #t~mem55;havoc #t~mem55; {40427#true} is VALID [2022-04-28 15:33:03,656 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:33:03,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {40427#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40427#true} is VALID [2022-04-28 15:33:03,657 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:33:03,657 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:33:03,658 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:33:03,658 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:33:03,658 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:33:03,659 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:33:03,659 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:33:03,659 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:33:03,660 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:33:03,660 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:33:03,660 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:33:03,661 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:33:03,661 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:33:03,661 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:33:03,661 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:33:03,661 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:33:03,661 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:33:03,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-28 15:33:03,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,662 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {40428#false} assume 8448 == #t~mem68;havoc #t~mem68; {40428#false} is VALID [2022-04-28 15:33:03,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {40428#false} assume !(~num1~0 > 0); {40428#false} is VALID [2022-04-28 15:33:03,663 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:33:03,663 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:33:03,663 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:33:03,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {40428#false} ~skip~0 := 0; {40428#false} is VALID [2022-04-28 15:33:03,664 INFO L290 TraceCheckUtils]: 74: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,664 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:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 INFO L290 TraceCheckUtils]: 93: Hoare triple {40428#false} assume 8544 == #t~mem64;havoc #t~mem64; {40428#false} is VALID [2022-04-28 15:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 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:33:03,665 INFO L290 TraceCheckUtils]: 100: Hoare triple {40428#false} assume 8 == ~blastFlag~0; {40428#false} is VALID [2022-04-28 15:33:03,665 INFO L290 TraceCheckUtils]: 101: Hoare triple {40428#false} assume !false; {40428#false} is VALID [2022-04-28 15:33:03,666 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:33:03,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031367391] [2022-04-28 15:33:03,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031367391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:03,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:03,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:03,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:03,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1404774152] [2022-04-28 15:33:03,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1404774152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:03,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:03,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:03,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526077] [2022-04-28 15:33:03,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:03,667 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:33:03,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:03,667 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:33:03,722 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:33:03,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:03,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:03,723 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:33:08,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:10,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:11,921 INFO L93 Difference]: Finished difference Result 609 states and 939 transitions. [2022-04-28 15:33:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:11,921 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:33:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:11,922 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:33:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:33:11,923 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:33:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:33:11,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:33:12,216 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:33:12,221 INFO L225 Difference]: With dead ends: 609 [2022-04-28 15:33:12,221 INFO L226 Difference]: Without dead ends: 326 [2022-04-28 15:33:12,227 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:33:12,228 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 31 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:12,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 511 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 387 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:33:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-28 15:33:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 309. [2022-04-28 15:33:12,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:12,239 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:33:12,240 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:33:12,240 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:33:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:12,244 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:33:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:33:12,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:12,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:12,245 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:33:12,245 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:33:12,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:12,249 INFO L93 Difference]: Finished difference Result 326 states and 495 transitions. [2022-04-28 15:33:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2022-04-28 15:33:12,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:12,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:12,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:12,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:12,250 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:33:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 472 transitions. [2022-04-28 15:33:12,254 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 472 transitions. Word has length 102 [2022-04-28 15:33:12,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:12,255 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 472 transitions. [2022-04-28 15:33:12,255 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:33:12,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 309 states and 472 transitions. [2022-04-28 15:33:12,637 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:33:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 472 transitions. [2022-04-28 15:33:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-28 15:33:12,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:12,638 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:33:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 15:33:12,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 1 times [2022-04-28 15:33:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:12,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1539116008] [2022-04-28 15:33:12,680 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:12,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash -472074122, now seen corresponding path program 2 times [2022-04-28 15:33:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:12,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082345352] [2022-04-28 15:33:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:12,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:12,788 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:33:12,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-28 15:33:12,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-28 15:33:12,789 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:33:12,789 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:33:12,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {42927#true} assume true; {42927#true} is VALID [2022-04-28 15:33:12,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42927#true} {42927#true} #690#return; {42927#true} is VALID [2022-04-28 15:33:12,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {42927#true} call #t~ret161 := main(); {42927#true} is VALID [2022-04-28 15:33:12,789 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:33:12,789 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:33:12,789 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:33:12,789 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-28 15:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,790 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:33:12,791 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:33:12,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {42927#true} assume 8464 == #t~mem55;havoc #t~mem55; {42927#true} is VALID [2022-04-28 15:33:12,791 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:33:12,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {42927#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42927#true} is VALID [2022-04-28 15:33:12,791 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:33:12,791 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:33:12,791 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:33:12,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {42927#true} ~skip~0 := 0; {42927#true} is VALID [2022-04-28 15:33:12,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {42927#true} assume !false; {42927#true} is VALID [2022-04-28 15:33:12,791 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:33:12,791 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:33:12,791 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:33:12,791 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:33:12,791 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:33:12,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {42927#true} assume 8195 == #t~mem51;havoc #t~mem51; {42927#true} is VALID [2022-04-28 15:33:12,792 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:33:12,792 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:33:12,792 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:33:12,792 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:33:12,792 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:33:12,792 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:33:12,812 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:33:12,812 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:33:12,812 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:33:12,813 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:33:12,813 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:33:12,813 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:33:12,814 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:33:12,814 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:33:12,814 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:33:12,815 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:33:12,815 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:33:12,815 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:33:12,815 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:33:12,815 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 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:33:12,816 INFO L290 TraceCheckUtils]: 71: Hoare triple {42928#false} assume 8448 == #t~mem68;havoc #t~mem68; {42928#false} is VALID [2022-04-28 15:33:12,817 INFO L290 TraceCheckUtils]: 72: Hoare triple {42928#false} assume !(~num1~0 > 0); {42928#false} is VALID [2022-04-28 15:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 INFO L290 TraceCheckUtils]: 76: Hoare triple {42928#false} ~skip~0 := 0; {42928#false} is VALID [2022-04-28 15:33:12,817 INFO L290 TraceCheckUtils]: 77: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-28 15:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 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:33:12,817 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 INFO L290 TraceCheckUtils]: 96: Hoare triple {42928#false} assume 8544 == #t~mem64;havoc #t~mem64; {42928#false} is VALID [2022-04-28 15:33:12,818 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:33:12,818 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:33:12,818 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:33:12,818 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:33:12,819 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:33:12,819 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:33:12,819 INFO L290 TraceCheckUtils]: 103: Hoare triple {42928#false} assume 8 == ~blastFlag~0; {42928#false} is VALID [2022-04-28 15:33:12,819 INFO L290 TraceCheckUtils]: 104: Hoare triple {42928#false} assume !false; {42928#false} is VALID [2022-04-28 15:33:12,819 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:33:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082345352] [2022-04-28 15:33:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082345352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:12,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:12,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1539116008] [2022-04-28 15:33:12,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1539116008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:12,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:12,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103028896] [2022-04-28 15:33:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:12,820 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:33:12,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:12,821 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:33:12,883 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:33:12,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:12,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:12,884 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:33:14,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:16,269 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:33:20,060 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:33:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:23,364 INFO L93 Difference]: Finished difference Result 620 states and 952 transitions. [2022-04-28 15:33:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:23,364 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:33:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:23,364 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:33:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:33:23,366 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:33:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2022-04-28 15:33:23,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 449 transitions. [2022-04-28 15:33:23,682 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:33:23,690 INFO L225 Difference]: With dead ends: 620 [2022-04-28 15:33:23,690 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 15:33:23,691 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:33:23,691 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 18 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:23,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 566 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 391 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-28 15:33:23,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 15:33:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-28 15:33:23,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:23,708 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:33:23,708 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:33:23,709 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:33:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:23,715 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:33:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:33:23,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:23,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:23,716 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:33:23,716 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:33:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:23,722 INFO L93 Difference]: Finished difference Result 337 states and 509 transitions. [2022-04-28 15:33:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2022-04-28 15:33:23,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:23,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:23,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:23,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:23,724 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:33:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 494 transitions. [2022-04-28 15:33:23,731 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 494 transitions. Word has length 105 [2022-04-28 15:33:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:23,731 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 494 transitions. [2022-04-28 15:33:23,731 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:33:23,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 494 transitions. [2022-04-28 15:33:24,174 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:33:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 494 transitions. [2022-04-28 15:33:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 15:33:24,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:24,175 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:33:24,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 15:33:24,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 1 times [2022-04-28 15:33:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:24,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100459111] [2022-04-28 15:33:24,227 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:24,228 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -888676307, now seen corresponding path program 2 times [2022-04-28 15:33:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:24,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651355245] [2022-04-28 15:33:24,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:24,327 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:33:24,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-28 15:33:24,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-28 15:33:24,328 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:33:24,328 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:33:24,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {45503#true} assume true; {45503#true} is VALID [2022-04-28 15:33:24,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45503#true} {45503#true} #690#return; {45503#true} is VALID [2022-04-28 15:33:24,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {45503#true} call #t~ret161 := main(); {45503#true} is VALID [2022-04-28 15:33:24,328 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {45503#true} assume !false; {45503#true} is VALID [2022-04-28 15:33:24,329 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:33:24,329 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:33:24,329 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:33:24,329 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:33:24,330 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:33:24,330 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:33:24,330 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:33:24,330 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:33:24,330 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:33:24,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {45503#true} assume 8464 == #t~mem55;havoc #t~mem55; {45503#true} is VALID [2022-04-28 15:33:24,330 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:33:24,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {45503#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45503#true} is VALID [2022-04-28 15:33:24,331 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:33:24,331 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:33:24,331 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:33:24,332 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:33:24,332 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:33:24,332 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:33:24,333 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:33:24,333 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:33:24,333 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:33:24,334 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:33:24,334 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:33:24,334 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:33:24,334 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:33:24,334 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:33:24,334 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:33:24,334 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:33:24,334 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:33:24,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {45504#false} assume 12292 != #t~mem85;havoc #t~mem85; {45504#false} is VALID [2022-04-28 15:33:24,335 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:33:24,335 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:33:24,335 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:33:24,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-28 15:33:24,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:33:24,335 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:33:24,335 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:33:24,335 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:33:24,335 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:33:24,335 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:33:24,335 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:33:24,335 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,336 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:33:24,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {45504#false} assume 8448 == #t~mem68;havoc #t~mem68; {45504#false} is VALID [2022-04-28 15:33:24,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {45504#false} assume !(~num1~0 > 0); {45504#false} is VALID [2022-04-28 15:33:24,337 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:33:24,337 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:33:24,337 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:33:24,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {45504#false} ~skip~0 := 0; {45504#false} is VALID [2022-04-28 15:33:24,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:33:24,337 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:33:24,337 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:33:24,337 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:33:24,337 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:33:24,337 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:33:24,337 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:33:24,337 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 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:33:24,338 INFO L290 TraceCheckUtils]: 97: Hoare triple {45504#false} assume 8544 == #t~mem64;havoc #t~mem64; {45504#false} is VALID [2022-04-28 15:33:24,338 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:33:24,338 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:33:24,338 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:33:24,339 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:33:24,339 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:33:24,339 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:33:24,339 INFO L290 TraceCheckUtils]: 104: Hoare triple {45504#false} assume 8 == ~blastFlag~0; {45504#false} is VALID [2022-04-28 15:33:24,339 INFO L290 TraceCheckUtils]: 105: Hoare triple {45504#false} assume !false; {45504#false} is VALID [2022-04-28 15:33:24,339 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:33:24,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:24,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651355245] [2022-04-28 15:33:24,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651355245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:24,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:24,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:24,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100459111] [2022-04-28 15:33:24,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100459111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:24,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:24,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669790491] [2022-04-28 15:33:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:24,340 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:33:24,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:24,341 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:33:24,389 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:33:24,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:24,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:24,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:24,390 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:33:30,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:32,084 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:33:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:33,248 INFO L93 Difference]: Finished difference Result 692 states and 1055 transitions. [2022-04-28 15:33:33,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:33,248 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:33:33,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:33,248 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:33:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:33:33,250 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:33:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-04-28 15:33:33,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 575 transitions. [2022-04-28 15:33:33,622 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:33:33,645 INFO L225 Difference]: With dead ends: 692 [2022-04-28 15:33:33,645 INFO L226 Difference]: Without dead ends: 393 [2022-04-28 15:33:33,646 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:33:33,646 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 134 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:33,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 408 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 485 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-28 15:33:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-28 15:33:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 325. [2022-04-28 15:33:33,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:33,660 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:33:33,660 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:33:33,660 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:33:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:33,666 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-28 15:33:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-28 15:33:33,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:33,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:33,666 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:33:33,667 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:33:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:33,673 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2022-04-28 15:33:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 585 transitions. [2022-04-28 15:33:33,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:33,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:33,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:33,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:33,674 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:33:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 488 transitions. [2022-04-28 15:33:33,681 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 488 transitions. Word has length 106 [2022-04-28 15:33:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:33,681 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 488 transitions. [2022-04-28 15:33:33,681 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:33:33,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 488 transitions. [2022-04-28 15:33:34,080 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:33:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 488 transitions. [2022-04-28 15:33:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-28 15:33:34,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:34,081 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:33:34,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 15:33:34,081 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 1 times [2022-04-28 15:33:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:34,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1201303973] [2022-04-28 15:33:34,136 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:34,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -863733163, now seen corresponding path program 2 times [2022-04-28 15:33:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:34,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900993828] [2022-04-28 15:33:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:34,233 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:33:34,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-28 15:33:34,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-28 15:33:34,234 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:33:34,234 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:33:34,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {48335#true} assume true; {48335#true} is VALID [2022-04-28 15:33:34,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48335#true} {48335#true} #690#return; {48335#true} is VALID [2022-04-28 15:33:34,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {48335#true} call #t~ret161 := main(); {48335#true} is VALID [2022-04-28 15:33:34,234 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-28 15:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,235 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:33:34,236 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:33:34,236 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:33:34,236 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:33:34,236 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:33:34,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {48335#true} assume 8464 == #t~mem55;havoc #t~mem55; {48335#true} is VALID [2022-04-28 15:33:34,236 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:33:34,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {48335#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48335#true} is VALID [2022-04-28 15:33:34,236 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:33:34,236 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:33:34,236 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:33:34,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {48335#true} ~skip~0 := 0; {48335#true} is VALID [2022-04-28 15:33:34,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {48335#true} assume !false; {48335#true} is VALID [2022-04-28 15:33:34,236 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:33:34,236 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,256 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:33:34,257 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:33:34,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {48335#true} assume 8496 == #t~mem58;havoc #t~mem58; {48335#true} is VALID [2022-04-28 15:33:34,257 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:33:34,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {48335#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {48335#true} is VALID [2022-04-28 15:33:34,257 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:33:34,258 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:33:34,259 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:33:34,259 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:33:34,259 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:33:34,260 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:33:34,260 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:33:34,260 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:33:34,261 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:33:34,261 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:33:34,261 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:33:34,262 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:33:34,262 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:33:34,262 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:33:34,263 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:33:34,263 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:33:34,263 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:33:34,264 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:33:34,264 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:33:34,264 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:33:34,265 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:33:34,265 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:33:34,265 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:33:34,265 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:33:34,266 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:33:34,266 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:33:34,266 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:33:34,267 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:33:34,267 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:33:34,267 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:33:34,267 INFO L290 TraceCheckUtils]: 77: Hoare triple {48336#false} assume !(~num1~0 > 0); {48336#false} is VALID [2022-04-28 15:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 INFO L290 TraceCheckUtils]: 81: Hoare triple {48336#false} ~skip~0 := 0; {48336#false} is VALID [2022-04-28 15:33:34,268 INFO L290 TraceCheckUtils]: 82: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-28 15:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,268 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 INFO L290 TraceCheckUtils]: 101: Hoare triple {48336#false} assume 8544 == #t~mem64;havoc #t~mem64; {48336#false} is VALID [2022-04-28 15:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,269 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:33:34,270 INFO L290 TraceCheckUtils]: 108: Hoare triple {48336#false} assume 8 == ~blastFlag~0; {48336#false} is VALID [2022-04-28 15:33:34,270 INFO L290 TraceCheckUtils]: 109: Hoare triple {48336#false} assume !false; {48336#false} is VALID [2022-04-28 15:33:34,270 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:33:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:34,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900993828] [2022-04-28 15:33:34,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900993828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:34,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:34,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:34,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:34,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1201303973] [2022-04-28 15:33:34,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1201303973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:34,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:34,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740829412] [2022-04-28 15:33:34,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:34,271 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:33:34,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:34,271 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:33:34,337 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:33:34,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:34,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:34,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:34,338 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:33:40,308 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:33:44,357 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:33:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:45,506 INFO L93 Difference]: Finished difference Result 768 states and 1165 transitions. [2022-04-28 15:33:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:45,506 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:33:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:45,507 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:33:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:33:45,509 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:33:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-04-28 15:33:45,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 570 transitions. [2022-04-28 15:33:45,888 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:33:45,897 INFO L225 Difference]: With dead ends: 768 [2022-04-28 15:33:45,898 INFO L226 Difference]: Without dead ends: 469 [2022-04-28 15:33:45,898 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:33:45,899 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 115 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:45,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 404 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:33:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-04-28 15:33:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 389. [2022-04-28 15:33:45,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:45,917 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:33:45,917 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:33:45,917 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:33:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:45,925 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-28 15:33:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-28 15:33:45,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:45,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:45,926 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:33:45,926 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:33:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:45,934 INFO L93 Difference]: Finished difference Result 469 states and 705 transitions. [2022-04-28 15:33:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 705 transitions. [2022-04-28 15:33:45,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:45,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:45,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:45,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:45,935 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:33:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 584 transitions. [2022-04-28 15:33:45,941 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 584 transitions. Word has length 110 [2022-04-28 15:33:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:45,942 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 584 transitions. [2022-04-28 15:33:45,942 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:33:45,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 584 transitions. [2022-04-28 15:33:46,480 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:33:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 584 transitions. [2022-04-28 15:33:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 15:33:46,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:46,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:33:46,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 15:33:46,481 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:46,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash -328927061, now seen corresponding path program 1 times [2022-04-28 15:33:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:46,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079547967] [2022-04-28 15:33:46,554 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:46,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -328927061, now seen corresponding path program 2 times [2022-04-28 15:33:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:46,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386617052] [2022-04-28 15:33:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:46,660 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:33:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-28 15:33:46,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-28 15:33:46,661 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:33:46,661 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:33:46,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {51599#true} assume true; {51599#true} is VALID [2022-04-28 15:33:46,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51599#true} {51599#true} #690#return; {51599#true} is VALID [2022-04-28 15:33:46,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {51599#true} call #t~ret161 := main(); {51599#true} is VALID [2022-04-28 15:33:46,661 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:33:46,661 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:33:46,661 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-28 15:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,662 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:33:46,663 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:33:46,663 INFO L290 TraceCheckUtils]: 24: Hoare triple {51599#true} assume 8464 == #t~mem55;havoc #t~mem55; {51599#true} is VALID [2022-04-28 15:33:46,663 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:33:46,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {51599#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {51599#true} is VALID [2022-04-28 15:33:46,663 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:33:46,663 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:33:46,663 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:33:46,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {51599#true} ~skip~0 := 0; {51599#true} is VALID [2022-04-28 15:33:46,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {51599#true} assume !false; {51599#true} is VALID [2022-04-28 15:33:46,663 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:33:46,663 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:33:46,663 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:33:46,663 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:33:46,663 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:33:46,663 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:33:46,664 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:33:46,664 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:33:46,664 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:33:46,664 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:33:46,664 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:33:46,664 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:33:46,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {51599#true} assume 8496 == #t~mem58;havoc #t~mem58; {51599#true} is VALID [2022-04-28 15:33:46,664 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:33:46,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {51599#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {51599#true} is VALID [2022-04-28 15:33:46,664 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:33:46,665 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:33:46,665 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:33:46,666 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:33:46,666 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:33:46,666 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:33:46,667 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:33:46,667 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:33:46,667 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:33:46,668 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:33:46,668 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:33:46,668 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:33:46,669 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:33:46,669 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:33:46,669 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:33:46,670 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:33:46,670 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:33:46,670 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:33:46,671 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:33:46,671 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:33:46,671 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:33:46,672 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:33:46,672 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:33:46,672 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:33:46,673 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:33:46,673 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:33:46,673 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:33:46,674 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:33:46,674 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:33:46,674 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:33:46,675 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:33:46,675 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:33:46,675 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:33:46,676 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:33:46,676 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:33:46,676 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:33:46,676 INFO L290 TraceCheckUtils]: 83: Hoare triple {51600#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {51600#false} is VALID [2022-04-28 15:33:46,676 INFO L290 TraceCheckUtils]: 84: Hoare triple {51600#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,676 INFO L290 TraceCheckUtils]: 85: Hoare triple {51600#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,676 INFO L290 TraceCheckUtils]: 86: Hoare triple {51600#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {51600#false} is VALID [2022-04-28 15:33:46,676 INFO L290 TraceCheckUtils]: 87: Hoare triple {51600#false} ~skip~0 := 0; {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 88: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 89: Hoare triple {51600#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 90: Hoare triple {51600#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {51600#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 92: Hoare triple {51600#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 93: Hoare triple {51600#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 94: Hoare triple {51600#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 95: Hoare triple {51600#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 96: Hoare triple {51600#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 97: Hoare triple {51600#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 98: Hoare triple {51600#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 99: Hoare triple {51600#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 100: Hoare triple {51600#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,677 INFO L290 TraceCheckUtils]: 101: Hoare triple {51600#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 102: Hoare triple {51600#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 103: Hoare triple {51600#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 104: Hoare triple {51600#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 105: Hoare triple {51600#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 106: Hoare triple {51600#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 107: Hoare triple {51600#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 108: Hoare triple {51600#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 109: Hoare triple {51600#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 110: Hoare triple {51600#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 111: Hoare triple {51600#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 112: Hoare triple {51600#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 113: Hoare triple {51600#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 114: Hoare triple {51600#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 115: Hoare triple {51600#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,678 INFO L290 TraceCheckUtils]: 116: Hoare triple {51600#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,679 INFO L290 TraceCheckUtils]: 117: Hoare triple {51600#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {51600#false} is VALID [2022-04-28 15:33:46,679 INFO L290 TraceCheckUtils]: 118: Hoare triple {51600#false} assume 8640 == #t~mem75;havoc #t~mem75; {51600#false} is VALID [2022-04-28 15:33:46,679 INFO L290 TraceCheckUtils]: 119: Hoare triple {51600#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {51600#false} is VALID [2022-04-28 15:33:46,679 INFO L290 TraceCheckUtils]: 120: Hoare triple {51600#false} assume 4 == ~blastFlag~0; {51600#false} is VALID [2022-04-28 15:33:46,679 INFO L290 TraceCheckUtils]: 121: Hoare triple {51600#false} assume !false; {51600#false} is VALID [2022-04-28 15:33:46,679 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:33:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:46,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386617052] [2022-04-28 15:33:46,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386617052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:46,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:46,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:46,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079547967] [2022-04-28 15:33:46,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079547967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:46,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:46,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916857884] [2022-04-28 15:33:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:46,681 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:33:46,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:46,681 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:33:46,759 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:33:46,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:46,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:46,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:46,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:46,760 INFO L87 Difference]: Start difference. First operand 389 states and 584 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:33:50,121 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:33:53,187 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:33:55,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:33:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:56,795 INFO L93 Difference]: Finished difference Result 860 states and 1297 transitions. [2022-04-28 15:33:56,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:33:56,795 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:33:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:33:56,796 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:33:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:33:56,798 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:33:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-04-28 15:33:56,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 574 transitions. [2022-04-28 15:33:57,196 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:33:57,206 INFO L225 Difference]: With dead ends: 860 [2022-04-28 15:33:57,206 INFO L226 Difference]: Without dead ends: 497 [2022-04-28 15:33:57,207 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:33:57,207 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 111 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 50 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:33:57,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 394 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-28 15:33:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-28 15:33:57,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 426. [2022-04-28 15:33:57,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:33:57,227 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:33:57,227 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:33:57,227 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:33:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:57,235 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-28 15:33:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-28 15:33:57,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:57,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:57,236 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:33:57,236 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:33:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:33:57,244 INFO L93 Difference]: Finished difference Result 497 states and 741 transitions. [2022-04-28 15:33:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 741 transitions. [2022-04-28 15:33:57,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:33:57,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:33:57,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:33:57,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:33:57,245 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:33:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2022-04-28 15:33:57,252 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 122 [2022-04-28 15:33:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:33:57,252 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2022-04-28 15:33:57,252 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:33:57,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 640 transitions. [2022-04-28 15:33:57,652 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:33:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2022-04-28 15:33:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:33:57,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:33:57,653 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:33:57,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 15:33:57,653 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:33:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:33:57,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 1 times [2022-04-28 15:33:57,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:57,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1327248757] [2022-04-28 15:33:57,734 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:33:57,734 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:33:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1052782150, now seen corresponding path program 2 times [2022-04-28 15:33:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:33:57,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179959549] [2022-04-28 15:33:57,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:33:57,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:33:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:33:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:33:57,848 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:33:57,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-28 15:33:57,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-28 15:33:57,848 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:33:57,849 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:33:57,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {55177#true} assume true; {55177#true} is VALID [2022-04-28 15:33:57,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55177#true} {55177#true} #690#return; {55177#true} is VALID [2022-04-28 15:33:57,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {55177#true} call #t~ret161 := main(); {55177#true} is VALID [2022-04-28 15:33:57,849 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:33:57,849 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:33:57,849 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:33:57,849 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:33:57,849 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:33:57,849 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:33:57,849 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:33:57,849 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:33:57,849 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:33:57,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-28 15:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 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:33:57,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {55177#true} assume 8464 == #t~mem55;havoc #t~mem55; {55177#true} is VALID [2022-04-28 15:33:57,850 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:33:57,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {55177#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {55177#true} is VALID [2022-04-28 15:33:57,850 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:33:57,850 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:33:57,851 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:33:57,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {55177#true} ~skip~0 := 0; {55177#true} is VALID [2022-04-28 15:33:57,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {55177#true} assume !false; {55177#true} is VALID [2022-04-28 15:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,851 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:33:57,852 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:33:57,852 INFO L290 TraceCheckUtils]: 44: Hoare triple {55177#true} assume 8496 == #t~mem58;havoc #t~mem58; {55177#true} is VALID [2022-04-28 15:33:57,852 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:33:57,852 INFO L290 TraceCheckUtils]: 46: Hoare triple {55177#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {55177#true} is VALID [2022-04-28 15:33:57,852 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:33:57,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {55177#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} ~skip~0 := 0; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,854 INFO L290 TraceCheckUtils]: 53: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !false; {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,856 INFO L290 TraceCheckUtils]: 58: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} is VALID [2022-04-28 15:33:57,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {55182#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8480))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55183#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 60: Hoare triple {55183#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 61: Hoare triple {55178#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 62: Hoare triple {55178#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8482, #t~mem91.base, 904 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 66: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 69: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 70: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,857 INFO L290 TraceCheckUtils]: 71: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 73: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 74: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 75: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 76: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 77: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 79: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,858 INFO L290 TraceCheckUtils]: 82: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 83: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 84: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 85: Hoare triple {55178#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 86: Hoare triple {55178#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 87: Hoare triple {55178#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 88: Hoare triple {55178#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 89: Hoare triple {55178#false} assume 8448 == #t~mem68;havoc #t~mem68; {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {55178#false} assume !(~num1~0 > 0); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 91: Hoare triple {55178#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem133 := read~int(#t~mem132.base, 904 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 72 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 92: Hoare triple {55178#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 93: Hoare triple {55178#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {55178#false} is VALID [2022-04-28 15:33:57,859 INFO L290 TraceCheckUtils]: 94: Hoare triple {55178#false} ~skip~0 := 0; {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 95: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 96: Hoare triple {55178#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 97: Hoare triple {55178#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 98: Hoare triple {55178#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 99: Hoare triple {55178#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 100: Hoare triple {55178#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 101: Hoare triple {55178#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 102: Hoare triple {55178#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 103: Hoare triple {55178#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 104: Hoare triple {55178#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 105: Hoare triple {55178#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 106: Hoare triple {55178#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 107: Hoare triple {55178#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,860 INFO L290 TraceCheckUtils]: 108: Hoare triple {55178#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 109: Hoare triple {55178#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 110: Hoare triple {55178#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 111: Hoare triple {55178#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 112: Hoare triple {55178#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 113: Hoare triple {55178#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 114: Hoare triple {55178#false} assume 8544 == #t~mem64;havoc #t~mem64; {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 115: Hoare triple {55178#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 116: Hoare triple {55178#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 117: Hoare triple {55178#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 118: Hoare triple {55178#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 119: Hoare triple {55178#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 120: Hoare triple {55178#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 121: Hoare triple {55178#false} assume 8 == ~blastFlag~0; {55178#false} is VALID [2022-04-28 15:33:57,861 INFO L290 TraceCheckUtils]: 122: Hoare triple {55178#false} assume !false; {55178#false} is VALID [2022-04-28 15:33:57,862 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:33:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:33:57,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179959549] [2022-04-28 15:33:57,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179959549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:57,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:57,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:57,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:33:57,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1327248757] [2022-04-28 15:33:57,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1327248757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:33:57,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:33:57,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:33:57,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093483881] [2022-04-28 15:33:57,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:33:57,864 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:33:57,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:33:57,864 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:33:57,929 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:33:57,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:33:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:33:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:33:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:33:57,930 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:00,480 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:34:05,924 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:34:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:07,046 INFO L93 Difference]: Finished difference Result 892 states and 1345 transitions. [2022-04-28 15:34:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:07,046 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:34:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:07,046 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:34:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:34:07,049 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:34:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 15:34:07,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-28 15:34:07,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:07,410 INFO L225 Difference]: With dead ends: 892 [2022-04-28 15:34:07,410 INFO L226 Difference]: Without dead ends: 492 [2022-04-28 15:34:07,411 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:34:07,411 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 132 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:07,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 362 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2022-04-28 15:34:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-04-28 15:34:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 426. [2022-04-28 15:34:07,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:07,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:07,433 INFO L74 IsIncluded]: Start isIncluded. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:07,434 INFO L87 Difference]: Start difference. First operand 492 states. Second operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:07,442 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-28 15:34:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-28 15:34:07,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:07,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:07,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 15:34:07,443 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 492 states. [2022-04-28 15:34:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:07,451 INFO L93 Difference]: Finished difference Result 492 states and 728 transitions. [2022-04-28 15:34:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 728 transitions. [2022-04-28 15:34:07,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:07,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:07,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:07,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:07,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.494061757719715) internal successors, (629), 421 states have internal predecessors, (629), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 633 transitions. [2022-04-28 15:34:07,460 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 633 transitions. Word has length 123 [2022-04-28 15:34:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:07,462 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 633 transitions. [2022-04-28 15:34:07,462 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:34:07,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 633 transitions. [2022-04-28 15:34:08,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 633 edges. 633 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 633 transitions. [2022-04-28 15:34:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:34:08,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:08,034 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:08,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 15:34:08,034 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 307351003, now seen corresponding path program 1 times [2022-04-28 15:34:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:08,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247287946] [2022-04-28 15:34:08,122 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:08,122 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:08,122 INFO L85 PathProgramCache]: Analyzing trace with hash 307351003, now seen corresponding path program 2 times [2022-04-28 15:34:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:08,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954102433] [2022-04-28 15:34:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:08,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {58809#true} is VALID [2022-04-28 15:34:08,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-28 15:34:08,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-28 15:34:08,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {58809#true} call ULTIMATE.init(); {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:34:08,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {58816#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {58809#true} is VALID [2022-04-28 15:34:08,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {58809#true} assume true; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58809#true} {58809#true} #690#return; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {58809#true} call #t~ret161 := main(); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {58809#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {58809#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L272 TraceCheckUtils]: 7: Hoare triple {58809#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {58809#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {58809#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {58809#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {58809#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {58809#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {58809#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {58809#true} assume 8464 == #t~mem55;havoc #t~mem55; {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {58809#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {58809#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {58809#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {58809#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {58809#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {58809#true} ~skip~0 := 0; {58809#true} is VALID [2022-04-28 15:34:08,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {58809#true} assume !false; {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {58809#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {58809#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {58809#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {58809#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 36: Hoare triple {58809#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 37: Hoare triple {58809#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {58809#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {58809#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {58809#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {58809#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {58809#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,241 INFO L290 TraceCheckUtils]: 43: Hoare triple {58809#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,241 INFO L290 TraceCheckUtils]: 44: Hoare triple {58809#true} assume 8496 == #t~mem58;havoc #t~mem58; {58809#true} is VALID [2022-04-28 15:34:08,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {58809#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {58809#true} is VALID [2022-04-28 15:34:08,241 INFO L290 TraceCheckUtils]: 46: Hoare triple {58809#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {58809#true} is VALID [2022-04-28 15:34:08,241 INFO L290 TraceCheckUtils]: 47: Hoare triple {58809#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {58809#true} is VALID [2022-04-28 15:34:08,242 INFO L290 TraceCheckUtils]: 48: Hoare triple {58809#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,242 INFO L290 TraceCheckUtils]: 49: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,245 INFO L290 TraceCheckUtils]: 58: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,246 INFO L290 TraceCheckUtils]: 59: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,246 INFO L290 TraceCheckUtils]: 61: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,249 INFO L290 TraceCheckUtils]: 68: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,249 INFO L290 TraceCheckUtils]: 69: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,249 INFO L290 TraceCheckUtils]: 70: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,251 INFO L290 TraceCheckUtils]: 74: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,262 INFO L290 TraceCheckUtils]: 77: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,262 INFO L290 TraceCheckUtils]: 78: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,262 INFO L290 TraceCheckUtils]: 79: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,263 INFO L290 TraceCheckUtils]: 80: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:08,263 INFO L290 TraceCheckUtils]: 81: Hoare triple {58814#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58815#(= |ssl3_accept_#t~mem74| 8656)} is VALID [2022-04-28 15:34:08,263 INFO L290 TraceCheckUtils]: 82: Hoare triple {58815#(= |ssl3_accept_#t~mem74| 8656)} assume 8609 == #t~mem74;havoc #t~mem74; {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 83: Hoare triple {58810#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 84: Hoare triple {58810#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {58810#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {58810#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {58810#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {58810#false} ~skip~0 := 0; {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {58810#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 91: Hoare triple {58810#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 92: Hoare triple {58810#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 93: Hoare triple {58810#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 94: Hoare triple {58810#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 95: Hoare triple {58810#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,264 INFO L290 TraceCheckUtils]: 96: Hoare triple {58810#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {58810#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 98: Hoare triple {58810#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 99: Hoare triple {58810#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {58810#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {58810#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {58810#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 103: Hoare triple {58810#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {58810#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {58810#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 106: Hoare triple {58810#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 107: Hoare triple {58810#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 108: Hoare triple {58810#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 109: Hoare triple {58810#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,265 INFO L290 TraceCheckUtils]: 110: Hoare triple {58810#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 111: Hoare triple {58810#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 112: Hoare triple {58810#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 113: Hoare triple {58810#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 114: Hoare triple {58810#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 115: Hoare triple {58810#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 116: Hoare triple {58810#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {58810#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 118: Hoare triple {58810#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 119: Hoare triple {58810#false} assume 8640 == #t~mem75;havoc #t~mem75; {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {58810#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 121: Hoare triple {58810#false} assume 4 == ~blastFlag~0; {58810#false} is VALID [2022-04-28 15:34:08,266 INFO L290 TraceCheckUtils]: 122: Hoare triple {58810#false} assume !false; {58810#false} is VALID [2022-04-28 15:34:08,267 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:34:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954102433] [2022-04-28 15:34:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954102433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:08,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:08,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247287946] [2022-04-28 15:34:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247287946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:08,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638094138] [2022-04-28 15:34:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:34:08,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:08,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:08,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:08,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:08,343 INFO L87 Difference]: Start difference. First operand 426 states and 633 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:12,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:14,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:16,762 INFO L93 Difference]: Finished difference Result 897 states and 1337 transitions. [2022-04-28 15:34:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:34:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-28 15:34:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-04-28 15:34:16,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 512 transitions. [2022-04-28 15:34:17,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 512 edges. 512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:17,117 INFO L225 Difference]: With dead ends: 897 [2022-04-28 15:34:17,117 INFO L226 Difference]: Without dead ends: 497 [2022-04-28 15:34:17,118 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:34:17,119 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 53 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:17,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 513 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 15:34:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-04-28 15:34:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 466. [2022-04-28 15:34:17,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:17,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:17,194 INFO L74 IsIncluded]: Start isIncluded. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:17,194 INFO L87 Difference]: Start difference. First operand 497 states. Second operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:17,207 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-28 15:34:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-28 15:34:17,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:17,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:17,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:34:17,209 INFO L87 Difference]: Start difference. First operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 497 states. [2022-04-28 15:34:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:17,219 INFO L93 Difference]: Finished difference Result 497 states and 733 transitions. [2022-04-28 15:34:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 733 transitions. [2022-04-28 15:34:17,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:17,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:17,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:17,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 461 states have (on average 1.492407809110629) internal successors, (688), 461 states have internal predecessors, (688), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 692 transitions. [2022-04-28 15:34:17,230 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 692 transitions. Word has length 123 [2022-04-28 15:34:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:17,230 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 692 transitions. [2022-04-28 15:34:17,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:17,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 466 states and 692 transitions. [2022-04-28 15:34:17,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 692 transitions. [2022-04-28 15:34:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-28 15:34:17,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:17,873 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 15:34:17,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 15:34:17,873 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:17,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2041455453, now seen corresponding path program 1 times [2022-04-28 15:34:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:17,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1194688269] [2022-04-28 15:34:17,956 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:17,956 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2041455453, now seen corresponding path program 2 times [2022-04-28 15:34:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:17,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254025612] [2022-04-28 15:34:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:18,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {62541#true} is VALID [2022-04-28 15:34:18,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-28 15:34:18,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {62541#true} call ULTIMATE.init(); {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:34:18,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {62548#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {62541#true} assume true; {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62541#true} {62541#true} #690#return; {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {62541#true} call #t~ret161 := main(); {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {62541#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {62541#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {62541#true} is VALID [2022-04-28 15:34:18,065 INFO L272 TraceCheckUtils]: 7: Hoare triple {62541#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {62541#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {62541#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {62541#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {62541#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {62541#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {62541#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {62541#true} assume 8464 == #t~mem55;havoc #t~mem55; {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {62541#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {62541#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {62541#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {62541#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {62541#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 30: Hoare triple {62541#true} ~skip~0 := 0; {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {62541#true} assume !false; {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {62541#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {62541#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {62541#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {62541#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,067 INFO L290 TraceCheckUtils]: 36: Hoare triple {62541#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {62541#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {62541#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {62541#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {62541#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {62541#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {62541#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 43: Hoare triple {62541#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 44: Hoare triple {62541#true} assume 8496 == #t~mem58;havoc #t~mem58; {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {62541#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {62541#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {62541#true} is VALID [2022-04-28 15:34:18,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {62541#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {62541#true} is VALID [2022-04-28 15:34:18,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {62541#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,070 INFO L290 TraceCheckUtils]: 50: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,070 INFO L290 TraceCheckUtils]: 51: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} ~skip~0 := 0; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !false; {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,075 INFO L290 TraceCheckUtils]: 65: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} is VALID [2022-04-28 15:34:18,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {62546#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62547#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {62547#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 69: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 70: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 75: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 80: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 81: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 82: Hoare triple {62542#false} assume 8609 == #t~mem74;havoc #t~mem74; {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {62542#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {62542#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {62542#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 86: Hoare triple {62542#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 87: Hoare triple {62542#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 88: Hoare triple {62542#false} ~skip~0 := 0; {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 89: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 90: Hoare triple {62542#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 91: Hoare triple {62542#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 92: Hoare triple {62542#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,077 INFO L290 TraceCheckUtils]: 93: Hoare triple {62542#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 94: Hoare triple {62542#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 95: Hoare triple {62542#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 96: Hoare triple {62542#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 97: Hoare triple {62542#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 98: Hoare triple {62542#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 99: Hoare triple {62542#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 100: Hoare triple {62542#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 101: Hoare triple {62542#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 102: Hoare triple {62542#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 103: Hoare triple {62542#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 104: Hoare triple {62542#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 105: Hoare triple {62542#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 106: Hoare triple {62542#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 107: Hoare triple {62542#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,078 INFO L290 TraceCheckUtils]: 108: Hoare triple {62542#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 109: Hoare triple {62542#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 110: Hoare triple {62542#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 111: Hoare triple {62542#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 112: Hoare triple {62542#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 113: Hoare triple {62542#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 114: Hoare triple {62542#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 115: Hoare triple {62542#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 116: Hoare triple {62542#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 117: Hoare triple {62542#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 118: Hoare triple {62542#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 119: Hoare triple {62542#false} assume 8640 == #t~mem75;havoc #t~mem75; {62542#false} is VALID [2022-04-28 15:34:18,079 INFO L290 TraceCheckUtils]: 120: Hoare triple {62542#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {62542#false} is VALID [2022-04-28 15:34:18,080 INFO L290 TraceCheckUtils]: 121: Hoare triple {62542#false} assume 4 == ~blastFlag~0; {62542#false} is VALID [2022-04-28 15:34:18,080 INFO L290 TraceCheckUtils]: 122: Hoare triple {62542#false} assume !false; {62542#false} is VALID [2022-04-28 15:34:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 15:34:18,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:18,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254025612] [2022-04-28 15:34:18,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254025612] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:18,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:18,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:18,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:18,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1194688269] [2022-04-28 15:34:18,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1194688269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:18,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:18,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:18,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286452506] [2022-04-28 15:34:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:18,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:34:18,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:18,081 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:34:18,141 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:34:18,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:18,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:18,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:18,142 INFO L87 Difference]: Start difference. First operand 466 states and 692 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:21,700 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:34:23,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:25,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:26,663 INFO L93 Difference]: Finished difference Result 943 states and 1408 transitions. [2022-04-28 15:34:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-28 15:34:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:26,664 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:34:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:34:26,665 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:34:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2022-04-28 15:34:26,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 466 transitions. [2022-04-28 15:34:26,932 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:34:26,942 INFO L225 Difference]: With dead ends: 943 [2022-04-28 15:34:26,943 INFO L226 Difference]: Without dead ends: 503 [2022-04-28 15:34:26,943 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:34:26,944 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 28 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:26,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 589 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 15:34:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-04-28 15:34:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 490. [2022-04-28 15:34:27,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:27,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:27,023 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:27,024 INFO L87 Difference]: Start difference. First operand 503 states. Second operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:27,048 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-28 15:34:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-28 15:34:27,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:27,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:27,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-28 15:34:27,049 INFO L87 Difference]: Start difference. First operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 503 states. [2022-04-28 15:34:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:27,064 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2022-04-28 15:34:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 745 transitions. [2022-04-28 15:34:27,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:27,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:27,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:27,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 485 states have (on average 1.4907216494845361) internal successors, (723), 485 states have internal predecessors, (723), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 727 transitions. [2022-04-28 15:34:27,092 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 727 transitions. Word has length 123 [2022-04-28 15:34:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:27,092 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 727 transitions. [2022-04-28 15:34:27,092 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:34:27,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 490 states and 727 transitions. [2022-04-28 15:34:27,779 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:34:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 727 transitions. [2022-04-28 15:34:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 15:34:27,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:27,780 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:34:27,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 15:34:27,780 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash -2114781281, now seen corresponding path program 1 times [2022-04-28 15:34:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:27,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1595141581] [2022-04-28 15:34:27,868 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:27,868 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2114781281, now seen corresponding path program 2 times [2022-04-28 15:34:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:27,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578590221] [2022-04-28 15:34:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:27,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:27,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66425#true} is VALID [2022-04-28 15:34:27,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-28 15:34:27,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {66425#true} call ULTIMATE.init(); {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {66432#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {66425#true} assume true; {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66425#true} {66425#true} #690#return; {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {66425#true} call #t~ret161 := main(); {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {66425#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {66425#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L272 TraceCheckUtils]: 7: Hoare triple {66425#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {66425#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {66425#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {66425#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {66425#true} is VALID [2022-04-28 15:34:27,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {66425#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {66425#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {66425#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {66425#true} assume 8464 == #t~mem55;havoc #t~mem55; {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {66425#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {66425#true} is VALID [2022-04-28 15:34:27,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {66425#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {66425#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {66425#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {66425#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {66425#true} ~skip~0 := 0; {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {66425#true} assume !false; {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {66425#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {66425#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {66425#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {66425#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {66425#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {66425#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {66425#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {66425#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {66425#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 41: Hoare triple {66425#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {66425#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {66425#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {66425#true} assume 8496 == #t~mem58;havoc #t~mem58; {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {66425#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {66425#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {66425#true} is VALID [2022-04-28 15:34:27,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {66425#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {66425#true} is VALID [2022-04-28 15:34:27,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {66425#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,979 INFO L290 TraceCheckUtils]: 58: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,980 INFO L290 TraceCheckUtils]: 60: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,980 INFO L290 TraceCheckUtils]: 61: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,981 INFO L290 TraceCheckUtils]: 63: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,981 INFO L290 TraceCheckUtils]: 64: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,982 INFO L290 TraceCheckUtils]: 66: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,982 INFO L290 TraceCheckUtils]: 67: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,983 INFO L290 TraceCheckUtils]: 70: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,984 INFO L290 TraceCheckUtils]: 72: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,984 INFO L290 TraceCheckUtils]: 73: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,985 INFO L290 TraceCheckUtils]: 75: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,985 INFO L290 TraceCheckUtils]: 76: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,986 INFO L290 TraceCheckUtils]: 77: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,986 INFO L290 TraceCheckUtils]: 78: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,986 INFO L290 TraceCheckUtils]: 79: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,987 INFO L290 TraceCheckUtils]: 80: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,987 INFO L290 TraceCheckUtils]: 81: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,987 INFO L290 TraceCheckUtils]: 82: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,988 INFO L290 TraceCheckUtils]: 83: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:27,988 INFO L290 TraceCheckUtils]: 84: Hoare triple {66430#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {66431#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 15:34:27,988 INFO L290 TraceCheckUtils]: 85: Hoare triple {66431#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,988 INFO L290 TraceCheckUtils]: 86: Hoare triple {66426#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 87: Hoare triple {66426#false} assume 8672 == #t~mem79;havoc #t~mem79; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 88: Hoare triple {66426#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 89: Hoare triple {66426#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 90: Hoare triple {66426#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 91: Hoare triple {66426#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 92: Hoare triple {66426#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 93: Hoare triple {66426#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 94: Hoare triple {66426#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 95: Hoare triple {66426#false} ~skip~0 := 0; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 96: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 97: Hoare triple {66426#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 98: Hoare triple {66426#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 99: Hoare triple {66426#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,989 INFO L290 TraceCheckUtils]: 100: Hoare triple {66426#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 101: Hoare triple {66426#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 102: Hoare triple {66426#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 103: Hoare triple {66426#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 104: Hoare triple {66426#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {66426#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {66426#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 107: Hoare triple {66426#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 108: Hoare triple {66426#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 109: Hoare triple {66426#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 110: Hoare triple {66426#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 111: Hoare triple {66426#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 112: Hoare triple {66426#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 113: Hoare triple {66426#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {66426#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 115: Hoare triple {66426#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 116: Hoare triple {66426#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 117: Hoare triple {66426#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 118: Hoare triple {66426#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 119: Hoare triple {66426#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 120: Hoare triple {66426#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 121: Hoare triple {66426#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 122: Hoare triple {66426#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 123: Hoare triple {66426#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 124: Hoare triple {66426#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 125: Hoare triple {66426#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 126: Hoare triple {66426#false} assume 8640 == #t~mem75;havoc #t~mem75; {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 127: Hoare triple {66426#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {66426#false} is VALID [2022-04-28 15:34:27,991 INFO L290 TraceCheckUtils]: 128: Hoare triple {66426#false} assume 4 == ~blastFlag~0; {66426#false} is VALID [2022-04-28 15:34:27,992 INFO L290 TraceCheckUtils]: 129: Hoare triple {66426#false} assume !false; {66426#false} is VALID [2022-04-28 15:34:27,992 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:34:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578590221] [2022-04-28 15:34:27,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578590221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:27,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:27,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:27,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1595141581] [2022-04-28 15:34:27,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1595141581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:27,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:27,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734292919] [2022-04-28 15:34:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:27,993 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:34:27,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:27,993 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:34:28,074 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:34:28,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:28,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:28,075 INFO L87 Difference]: Start difference. First operand 490 states and 727 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:29,711 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:34:31,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:33,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:35,574 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:34:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:36,610 INFO L93 Difference]: Finished difference Result 979 states and 1456 transitions. [2022-04-28 15:34:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:36,610 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:34:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:36,611 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:34:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-04-28 15:34:36,613 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:34:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2022-04-28 15:34:36,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 502 transitions. [2022-04-28 15:34:36,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:36,883 INFO L225 Difference]: With dead ends: 979 [2022-04-28 15:34:36,883 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 15:34:36,884 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:34:36,884 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 41 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:36,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 519 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-28 15:34:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 15:34:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-04-28 15:34:36,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:36,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:36,926 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:36,926 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:36,935 INFO L93 Difference]: Finished difference Result 515 states and 758 transitions. [2022-04-28 15:34:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 758 transitions. [2022-04-28 15:34:36,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:36,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:36,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 15:34:36,936 INFO L87 Difference]: Start difference. First operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 15:34:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:36,945 INFO L93 Difference]: Finished difference Result 515 states and 758 transitions. [2022-04-28 15:34:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 758 transitions. [2022-04-28 15:34:36,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:36,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:36,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:36,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.4877049180327868) internal successors, (726), 488 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 730 transitions. [2022-04-28 15:34:36,956 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 730 transitions. Word has length 130 [2022-04-28 15:34:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:36,956 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 730 transitions. [2022-04-28 15:34:36,956 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:34:36,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 493 states and 730 transitions. [2022-04-28 15:34:37,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 730 transitions. [2022-04-28 15:34:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:34:37,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:37,621 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:34:37,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 15:34:37,621 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 1 times [2022-04-28 15:34:37,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:37,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332787572] [2022-04-28 15:34:37,713 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:37,713 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -881988740, now seen corresponding path program 2 times [2022-04-28 15:34:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477066467] [2022-04-28 15:34:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:37,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {70418#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {70411#true} is VALID [2022-04-28 15:34:37,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {70411#true} assume true; {70411#true} is VALID [2022-04-28 15:34:37,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70411#true} {70411#true} #690#return; {70411#true} is VALID [2022-04-28 15:34:37,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {70411#true} call ULTIMATE.init(); {70418#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:34:37,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {70418#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {70411#true} is VALID [2022-04-28 15:34:37,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {70411#true} assume true; {70411#true} is VALID [2022-04-28 15:34:37,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70411#true} {70411#true} #690#return; {70411#true} is VALID [2022-04-28 15:34:37,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {70411#true} call #t~ret161 := main(); {70411#true} is VALID [2022-04-28 15:34:37,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {70411#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {70411#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L272 TraceCheckUtils]: 7: Hoare triple {70411#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {70411#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {70411#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {70411#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {70411#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {70411#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {70411#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {70411#true} assume !false; {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {70411#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {70411#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {70411#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {70411#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {70411#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {70411#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {70411#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {70411#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {70411#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {70411#true} assume 8464 == #t~mem55;havoc #t~mem55; {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {70411#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {70411#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {70411#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {70411#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {70411#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {70411#true} ~skip~0 := 0; {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {70411#true} assume !false; {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {70411#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {70411#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {70411#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {70411#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {70411#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {70411#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {70411#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {70411#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {70411#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {70411#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {70411#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {70411#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {70411#true} assume 8496 == #t~mem58;havoc #t~mem58; {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {70411#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {70411#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70411#true} is VALID [2022-04-28 15:34:37,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {70411#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {70411#true} is VALID [2022-04-28 15:34:37,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {70411#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,816 INFO L290 TraceCheckUtils]: 51: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,818 INFO L290 TraceCheckUtils]: 57: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,821 INFO L290 TraceCheckUtils]: 66: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {70416#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70417#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {70417#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {70412#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {70412#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {70412#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {70412#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {70412#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {70412#false} ~skip~0 := 0; {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {70412#false} assume !false; {70412#false} is VALID [2022-04-28 15:34:37,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {70412#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 77: Hoare triple {70412#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {70412#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {70412#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {70412#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {70412#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {70412#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {70412#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {70412#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {70412#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {70412#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 87: Hoare triple {70412#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {70412#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {70412#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {70412#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,823 INFO L290 TraceCheckUtils]: 91: Hoare triple {70412#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 92: Hoare triple {70412#false} assume 8528 == #t~mem62;havoc #t~mem62; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {70412#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {70412#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {70412#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {70412#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {70412#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {70412#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 99: Hoare triple {70412#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {70412#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {70412#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {70412#false} ~skip~0 := 0; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {70412#false} assume !false; {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {70412#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {70412#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 106: Hoare triple {70412#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 107: Hoare triple {70412#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 108: Hoare triple {70412#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 109: Hoare triple {70412#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 110: Hoare triple {70412#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 111: Hoare triple {70412#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 112: Hoare triple {70412#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 113: Hoare triple {70412#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 114: Hoare triple {70412#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 115: Hoare triple {70412#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 116: Hoare triple {70412#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 117: Hoare triple {70412#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 118: Hoare triple {70412#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 119: Hoare triple {70412#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,825 INFO L290 TraceCheckUtils]: 120: Hoare triple {70412#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 121: Hoare triple {70412#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 122: Hoare triple {70412#false} assume 8544 == #t~mem64;havoc #t~mem64; {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 123: Hoare triple {70412#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 124: Hoare triple {70412#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 125: Hoare triple {70412#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 126: Hoare triple {70412#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 127: Hoare triple {70412#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 128: Hoare triple {70412#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 129: Hoare triple {70412#false} assume 8 == ~blastFlag~0; {70412#false} is VALID [2022-04-28 15:34:37,826 INFO L290 TraceCheckUtils]: 130: Hoare triple {70412#false} assume !false; {70412#false} is VALID [2022-04-28 15:34:37,826 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:34:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:37,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477066467] [2022-04-28 15:34:37,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477066467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:37,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:37,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:37,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:37,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332787572] [2022-04-28 15:34:37,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332787572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:37,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:37,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:34:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656141929] [2022-04-28 15:34:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:37,828 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:34:37,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:37,828 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:34:37,897 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:34:37,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:34:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:37,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:34:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:34:37,898 INFO L87 Difference]: Start difference. First operand 493 states and 730 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:41,082 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:43,087 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:34:47,053 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:34:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:48,161 INFO L93 Difference]: Finished difference Result 982 states and 1458 transitions. [2022-04-28 15:34:48,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:34:48,162 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:34:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:48,163 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:34:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:34:48,165 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:34:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-28 15:34:48,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-28 15:34:48,439 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:34:48,450 INFO L225 Difference]: With dead ends: 982 [2022-04-28 15:34:48,450 INFO L226 Difference]: Without dead ends: 515 [2022-04-28 15:34:48,451 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:34:48,451 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 57 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:48,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 535 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-04-28 15:34:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-04-28 15:34:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 493. [2022-04-28 15:34:48,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:48,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:48,498 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:48,498 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:48,506 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-28 15:34:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-28 15:34:48,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:48,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:48,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 15:34:48,507 INFO L87 Difference]: Start difference. First operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 515 states. [2022-04-28 15:34:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:48,516 INFO L93 Difference]: Finished difference Result 515 states and 757 transitions. [2022-04-28 15:34:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 757 transitions. [2022-04-28 15:34:48,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:48,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:48,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:48,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 488 states have (on average 1.485655737704918) internal successors, (725), 488 states have internal predecessors, (725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2022-04-28 15:34:48,526 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 131 [2022-04-28 15:34:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:48,526 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2022-04-28 15:34:48,526 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:34:48,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 493 states and 729 transitions. [2022-04-28 15:34:49,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:34:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2022-04-28 15:34:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:34:49,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:34:49,278 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:34:49,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 15:34:49,278 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:34:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:34:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 1 times [2022-04-28 15:34:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1964452540] [2022-04-28 15:34:49,362 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:34:49,363 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:34:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 442867454, now seen corresponding path program 2 times [2022-04-28 15:34:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:34:49,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207607794] [2022-04-28 15:34:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:34:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:34:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:34:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:34:49,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {74409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74403#true} is VALID [2022-04-28 15:34:49,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {74403#true} assume true; {74403#true} is VALID [2022-04-28 15:34:49,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74403#true} {74403#true} #690#return; {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {74403#true} call ULTIMATE.init(); {74409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:34:49,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {74409#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {74403#true} assume true; {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74403#true} {74403#true} #690#return; {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {74403#true} call #t~ret161 := main(); {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {74403#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {74403#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {74403#true} is VALID [2022-04-28 15:34:49,485 INFO L272 TraceCheckUtils]: 7: Hoare triple {74403#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {74403#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {74403#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {74403#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {74403#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {74403#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {74403#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 14: Hoare triple {74403#true} assume !false; {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {74403#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {74403#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {74403#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {74403#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {74403#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {74403#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {74403#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {74403#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {74403#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {74403#true} assume 8464 == #t~mem55;havoc #t~mem55; {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {74403#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {74403#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {74403#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {74403#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {74403#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {74403#true} ~skip~0 := 0; {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {74403#true} assume !false; {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {74403#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {74403#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {74403#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {74403#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {74403#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {74403#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {74403#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {74403#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {74403#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {74403#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {74403#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 43: Hoare triple {74403#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 44: Hoare triple {74403#true} assume 8496 == #t~mem58;havoc #t~mem58; {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {74403#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74403#true} is VALID [2022-04-28 15:34:49,488 INFO L290 TraceCheckUtils]: 46: Hoare triple {74403#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,489 INFO L290 TraceCheckUtils]: 47: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,490 INFO L290 TraceCheckUtils]: 53: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,495 INFO L290 TraceCheckUtils]: 71: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,495 INFO L290 TraceCheckUtils]: 72: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,495 INFO L290 TraceCheckUtils]: 73: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,496 INFO L290 TraceCheckUtils]: 74: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,496 INFO L290 TraceCheckUtils]: 75: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,496 INFO L290 TraceCheckUtils]: 76: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,498 INFO L290 TraceCheckUtils]: 82: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,498 INFO L290 TraceCheckUtils]: 83: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,498 INFO L290 TraceCheckUtils]: 84: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,499 INFO L290 TraceCheckUtils]: 86: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,499 INFO L290 TraceCheckUtils]: 87: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,499 INFO L290 TraceCheckUtils]: 88: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,499 INFO L290 TraceCheckUtils]: 89: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,500 INFO L290 TraceCheckUtils]: 90: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,500 INFO L290 TraceCheckUtils]: 91: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,500 INFO L290 TraceCheckUtils]: 92: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8528 == #t~mem62;havoc #t~mem62; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,500 INFO L290 TraceCheckUtils]: 93: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,501 INFO L290 TraceCheckUtils]: 94: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,501 INFO L290 TraceCheckUtils]: 95: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,501 INFO L290 TraceCheckUtils]: 96: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,501 INFO L290 TraceCheckUtils]: 97: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,502 INFO L290 TraceCheckUtils]: 98: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,502 INFO L290 TraceCheckUtils]: 99: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,502 INFO L290 TraceCheckUtils]: 100: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,502 INFO L290 TraceCheckUtils]: 101: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,503 INFO L290 TraceCheckUtils]: 102: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,503 INFO L290 TraceCheckUtils]: 103: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,503 INFO L290 TraceCheckUtils]: 104: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,503 INFO L290 TraceCheckUtils]: 105: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,504 INFO L290 TraceCheckUtils]: 106: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,504 INFO L290 TraceCheckUtils]: 107: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,504 INFO L290 TraceCheckUtils]: 108: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,504 INFO L290 TraceCheckUtils]: 109: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,505 INFO L290 TraceCheckUtils]: 110: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,505 INFO L290 TraceCheckUtils]: 111: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,505 INFO L290 TraceCheckUtils]: 112: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,505 INFO L290 TraceCheckUtils]: 113: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,506 INFO L290 TraceCheckUtils]: 114: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,506 INFO L290 TraceCheckUtils]: 115: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,506 INFO L290 TraceCheckUtils]: 116: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,506 INFO L290 TraceCheckUtils]: 117: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,507 INFO L290 TraceCheckUtils]: 118: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,507 INFO L290 TraceCheckUtils]: 119: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,507 INFO L290 TraceCheckUtils]: 120: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,508 INFO L290 TraceCheckUtils]: 121: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,508 INFO L290 TraceCheckUtils]: 122: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8544 == #t~mem64;havoc #t~mem64; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,508 INFO L290 TraceCheckUtils]: 123: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,508 INFO L290 TraceCheckUtils]: 124: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,509 INFO L290 TraceCheckUtils]: 125: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,509 INFO L290 TraceCheckUtils]: 126: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,509 INFO L290 TraceCheckUtils]: 127: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,509 INFO L290 TraceCheckUtils]: 128: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {74408#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:34:49,510 INFO L290 TraceCheckUtils]: 129: Hoare triple {74408#(= 2 ssl3_accept_~blastFlag~0)} assume 8 == ~blastFlag~0; {74404#false} is VALID [2022-04-28 15:34:49,510 INFO L290 TraceCheckUtils]: 130: Hoare triple {74404#false} assume !false; {74404#false} is VALID [2022-04-28 15:34:49,510 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:34:49,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:34:49,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207607794] [2022-04-28 15:34:49,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207607794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:49,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:49,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:34:49,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:34:49,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1964452540] [2022-04-28 15:34:49,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1964452540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:34:49,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:34:49,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:34:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527640028] [2022-04-28 15:34:49,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:34:49,513 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:34:49,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:34:49,513 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:34:49,573 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:34:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:34:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:34:49,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:34:49,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:34:49,576 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:52,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:54,032 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:34:57,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:34:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:58,718 INFO L93 Difference]: Finished difference Result 1422 states and 2123 transitions. [2022-04-28 15:34:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:34:58,719 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:34:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:34:58,719 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:34:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-28 15:34:58,721 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:34:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2022-04-28 15:34:58,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 603 transitions. [2022-04-28 15:34:59,133 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:34:59,170 INFO L225 Difference]: With dead ends: 1422 [2022-04-28 15:34:59,170 INFO L226 Difference]: Without dead ends: 955 [2022-04-28 15:34:59,171 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:34:59,171 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 136 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 15:34:59,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 439 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 15:34:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-04-28 15:34:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-04-28 15:34:59,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:34:59,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,220 INFO L74 IsIncluded]: Start isIncluded. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,220 INFO L87 Difference]: Start difference. First operand 955 states. Second operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:59,246 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-28 15:34:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-28 15:34:59,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:59,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:59,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-28 15:34:59,248 INFO L87 Difference]: Start difference. First operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 955 states. [2022-04-28 15:34:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:34:59,272 INFO L93 Difference]: Finished difference Result 955 states and 1414 transitions. [2022-04-28 15:34:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-28 15:34:59,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:34:59,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:34:59,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:34:59,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:34:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 950 states have (on average 1.4842105263157894) internal successors, (1410), 950 states have internal predecessors, (1410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:34:59,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1414 transitions. [2022-04-28 15:34:59,318 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1414 transitions. Word has length 131 [2022-04-28 15:34:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:34:59,318 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1414 transitions. [2022-04-28 15:34:59,318 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:34:59,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 955 states and 1414 transitions. [2022-04-28 15:35:00,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1414 edges. 1414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1414 transitions. [2022-04-28 15:35:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:35:00,585 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:00,586 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:35:00,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 15:35:00,586 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 1 times [2022-04-28 15:35:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76840041] [2022-04-28 15:35:00,672 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:00,672 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1975617024, now seen corresponding path program 2 times [2022-04-28 15:35:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:00,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067008084] [2022-04-28 15:35:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:00,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:00,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {81082#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81076#true} is VALID [2022-04-28 15:35:00,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {81076#true} assume true; {81076#true} is VALID [2022-04-28 15:35:00,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {81076#true} {81076#true} #690#return; {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {81076#true} call ULTIMATE.init(); {81082#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {81082#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {81076#true} assume true; {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {81076#true} {81076#true} #690#return; {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {81076#true} call #t~ret161 := main(); {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {81076#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {81076#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L272 TraceCheckUtils]: 7: Hoare triple {81076#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {81076#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {81076#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {81076#true} is VALID [2022-04-28 15:35:00,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {81076#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {81076#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {81076#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {81076#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {81076#true} assume !false; {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {81076#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {81076#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {81076#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {81076#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {81076#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {81076#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {81076#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {81076#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {81076#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81076#true} is VALID [2022-04-28 15:35:00,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {81076#true} assume 8464 == #t~mem55;havoc #t~mem55; {81076#true} is VALID [2022-04-28 15:35:00,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {81076#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {81076#true} is VALID [2022-04-28 15:35:00,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {81076#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !false; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {81081#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {81081#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {81077#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {81077#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {81077#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {81077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {81077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {81077#false} ~skip~0 := 0; {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {81077#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {81077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {81077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {81077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {81077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {81077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {81077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {81077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {81077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {81077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {81077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 65: Hoare triple {81077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 66: Hoare triple {81077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 67: Hoare triple {81077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {81077#false} assume 8512 == #t~mem60;havoc #t~mem60; {81077#false} is VALID [2022-04-28 15:35:00,793 INFO L290 TraceCheckUtils]: 69: Hoare triple {81077#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {81077#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 71: Hoare triple {81077#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 72: Hoare triple {81077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 73: Hoare triple {81077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 74: Hoare triple {81077#false} ~skip~0 := 0; {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {81077#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 77: Hoare triple {81077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 78: Hoare triple {81077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 79: Hoare triple {81077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 80: Hoare triple {81077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {81077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {81077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {81077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {81077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {81077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {81077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 87: Hoare triple {81077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 88: Hoare triple {81077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {81077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {81077#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {81077#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 92: Hoare triple {81077#false} assume 8528 == #t~mem62;havoc #t~mem62; {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 93: Hoare triple {81077#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {81077#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {81077#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {81077#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 97: Hoare triple {81077#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {81077#false} is VALID [2022-04-28 15:35:00,795 INFO L290 TraceCheckUtils]: 98: Hoare triple {81077#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {81077#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {81077#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {81077#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 102: Hoare triple {81077#false} ~skip~0 := 0; {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 103: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {81077#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 105: Hoare triple {81077#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 106: Hoare triple {81077#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 107: Hoare triple {81077#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 108: Hoare triple {81077#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 109: Hoare triple {81077#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 110: Hoare triple {81077#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 111: Hoare triple {81077#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,796 INFO L290 TraceCheckUtils]: 112: Hoare triple {81077#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 113: Hoare triple {81077#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 114: Hoare triple {81077#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 115: Hoare triple {81077#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 116: Hoare triple {81077#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 117: Hoare triple {81077#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 118: Hoare triple {81077#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 119: Hoare triple {81077#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 120: Hoare triple {81077#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 121: Hoare triple {81077#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 122: Hoare triple {81077#false} assume 8544 == #t~mem64;havoc #t~mem64; {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 123: Hoare triple {81077#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 124: Hoare triple {81077#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {81077#false} is VALID [2022-04-28 15:35:00,797 INFO L290 TraceCheckUtils]: 125: Hoare triple {81077#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {81077#false} is VALID [2022-04-28 15:35:00,798 INFO L290 TraceCheckUtils]: 126: Hoare triple {81077#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {81077#false} is VALID [2022-04-28 15:35:00,798 INFO L290 TraceCheckUtils]: 127: Hoare triple {81077#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {81077#false} is VALID [2022-04-28 15:35:00,798 INFO L290 TraceCheckUtils]: 128: Hoare triple {81077#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {81077#false} is VALID [2022-04-28 15:35:00,798 INFO L290 TraceCheckUtils]: 129: Hoare triple {81077#false} assume 8 == ~blastFlag~0; {81077#false} is VALID [2022-04-28 15:35:00,798 INFO L290 TraceCheckUtils]: 130: Hoare triple {81077#false} assume !false; {81077#false} is VALID [2022-04-28 15:35:00,798 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:35:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067008084] [2022-04-28 15:35:00,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067008084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:00,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:00,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:00,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:00,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76840041] [2022-04-28 15:35:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76840041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:00,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:00,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062044076] [2022-04-28 15:35:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:00,799 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:35:00,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:00,799 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:35:00,863 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:35:00,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:35:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:35:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:35:00,864 INFO L87 Difference]: Start difference. First operand 955 states and 1414 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:03,532 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:35:05,536 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:35:07,565 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:35:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:08,392 INFO L93 Difference]: Finished difference Result 1911 states and 2835 transitions. [2022-04-28 15:35:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:35:08,392 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:35:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:08,392 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:35:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:35:08,394 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:35:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-04-28 15:35:08,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-04-28 15:35:08,707 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:35:08,745 INFO L225 Difference]: With dead ends: 1911 [2022-04-28 15:35:08,745 INFO L226 Difference]: Without dead ends: 982 [2022-04-28 15:35:08,746 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:35:08,747 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:08,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 15:35:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-28 15:35:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2022-04-28 15:35:08,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:08,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:08,806 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:08,806 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:08,831 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-28 15:35:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-28 15:35:08,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:08,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:08,833 INFO L74 IsIncluded]: Start isIncluded. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-28 15:35:08,834 INFO L87 Difference]: Start difference. First operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 982 states. [2022-04-28 15:35:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:08,859 INFO L93 Difference]: Finished difference Result 982 states and 1449 transitions. [2022-04-28 15:35:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-28 15:35:08,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:08,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:08,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:08,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 977 states have (on average 1.4790174002047083) internal successors, (1445), 977 states have internal predecessors, (1445), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1449 transitions. [2022-04-28 15:35:08,913 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1449 transitions. Word has length 131 [2022-04-28 15:35:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:08,913 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1449 transitions. [2022-04-28 15:35:08,913 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:35:08,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 982 states and 1449 transitions. [2022-04-28 15:35:10,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1449 edges. 1449 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1449 transitions. [2022-04-28 15:35:10,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 15:35:10,299 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:10,299 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:35:10,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 15:35:10,299 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 1 times [2022-04-28 15:35:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:10,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910265338] [2022-04-28 15:35:10,390 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:10,390 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1857175550, now seen corresponding path program 2 times [2022-04-28 15:35:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910835037] [2022-04-28 15:35:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:10,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:10,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {88841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88835#true} is VALID [2022-04-28 15:35:10,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {88835#true} assume true; {88835#true} is VALID [2022-04-28 15:35:10,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88835#true} {88835#true} #690#return; {88835#true} is VALID [2022-04-28 15:35:10,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {88835#true} call ULTIMATE.init(); {88841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:35:10,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {88841#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {88835#true} assume true; {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88835#true} {88835#true} #690#return; {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {88835#true} call #t~ret161 := main(); {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {88835#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {88835#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L272 TraceCheckUtils]: 7: Hoare triple {88835#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88835#true} is VALID [2022-04-28 15:35:10,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {88835#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !false; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,479 INFO L290 TraceCheckUtils]: 24: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {88840#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {88840#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 27: Hoare triple {88836#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 36: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {88836#false} assume 8496 == #t~mem58;havoc #t~mem58; {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {88836#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {88836#false} assume !(1 == ~blastFlag~0); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 47: Hoare triple {88836#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {88836#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {88836#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 51: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 55: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 57: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 58: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 60: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,482 INFO L290 TraceCheckUtils]: 63: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {88836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 67: Hoare triple {88836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 68: Hoare triple {88836#false} assume 8512 == #t~mem60;havoc #t~mem60; {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 69: Hoare triple {88836#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 70: Hoare triple {88836#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 71: Hoare triple {88836#false} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 72: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 74: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 79: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 80: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 81: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 82: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 83: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 84: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 85: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 86: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 87: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {88836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {88836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {88836#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 91: Hoare triple {88836#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,484 INFO L290 TraceCheckUtils]: 92: Hoare triple {88836#false} assume 8528 == #t~mem62;havoc #t~mem62; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 93: Hoare triple {88836#false} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 94: Hoare triple {88836#false} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 95: Hoare triple {88836#false} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 96: Hoare triple {88836#false} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 97: Hoare triple {88836#false} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 98: Hoare triple {88836#false} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 99: Hoare triple {88836#false} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 100: Hoare triple {88836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 101: Hoare triple {88836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 102: Hoare triple {88836#false} ~skip~0 := 0; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 103: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 104: Hoare triple {88836#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 105: Hoare triple {88836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 106: Hoare triple {88836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,485 INFO L290 TraceCheckUtils]: 107: Hoare triple {88836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 108: Hoare triple {88836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 109: Hoare triple {88836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 110: Hoare triple {88836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 111: Hoare triple {88836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 112: Hoare triple {88836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 113: Hoare triple {88836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 114: Hoare triple {88836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 115: Hoare triple {88836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 116: Hoare triple {88836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 117: Hoare triple {88836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 118: Hoare triple {88836#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 119: Hoare triple {88836#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 120: Hoare triple {88836#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 121: Hoare triple {88836#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,486 INFO L290 TraceCheckUtils]: 122: Hoare triple {88836#false} assume 8544 == #t~mem64;havoc #t~mem64; {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 123: Hoare triple {88836#false} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 124: Hoare triple {88836#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 125: Hoare triple {88836#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 126: Hoare triple {88836#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 127: Hoare triple {88836#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 128: Hoare triple {88836#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 129: Hoare triple {88836#false} assume 8 == ~blastFlag~0; {88836#false} is VALID [2022-04-28 15:35:10,487 INFO L290 TraceCheckUtils]: 130: Hoare triple {88836#false} assume !false; {88836#false} is VALID [2022-04-28 15:35:10,487 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:35:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910835037] [2022-04-28 15:35:10,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910835037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:10,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:10,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:10,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:10,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910265338] [2022-04-28 15:35:10,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910265338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:10,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:10,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057486264] [2022-04-28 15:35:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:10,489 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:35:10,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:10,489 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:35:10,543 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:35:10,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:35:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:35:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:35:10,544 INFO L87 Difference]: Start difference. First operand 982 states and 1449 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:16,420 INFO L93 Difference]: Finished difference Result 1940 states and 2871 transitions. [2022-04-28 15:35:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:35:16,420 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:35:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:16,421 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:35:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:35:16,422 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:35:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2022-04-28 15:35:16,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 425 transitions. [2022-04-28 15:35:16,638 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:35:16,686 INFO L225 Difference]: With dead ends: 1940 [2022-04-28 15:35:16,686 INFO L226 Difference]: Without dead ends: 984 [2022-04-28 15:35:16,687 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:35:16,689 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:16,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 15:35:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-04-28 15:35:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2022-04-28 15:35:16,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:16,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:16,738 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:16,738 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:16,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:16,763 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-28 15:35:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-28 15:35:16,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:16,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:16,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-28 15:35:16,765 INFO L87 Difference]: Start difference. First operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 984 states. [2022-04-28 15:35:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:16,790 INFO L93 Difference]: Finished difference Result 984 states and 1451 transitions. [2022-04-28 15:35:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-28 15:35:16,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:16,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:16,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:16,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 979 states have (on average 1.4780388151174668) internal successors, (1447), 979 states have internal predecessors, (1447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1451 transitions. [2022-04-28 15:35:16,827 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1451 transitions. Word has length 131 [2022-04-28 15:35:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:16,827 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 1451 transitions. [2022-04-28 15:35:16,827 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:35:16,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 984 states and 1451 transitions. [2022-04-28 15:35:18,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1451 edges. 1451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1451 transitions. [2022-04-28 15:35:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 15:35:18,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:18,175 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:35:18,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 15:35:18,175 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:18,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:18,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 1 times [2022-04-28 15:35:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100778301] [2022-04-28 15:35:18,264 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:18,264 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1541930600, now seen corresponding path program 2 times [2022-04-28 15:35:18,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:18,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631952700] [2022-04-28 15:35:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:18,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {96666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96660#true} is VALID [2022-04-28 15:35:18,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {96660#true} assume true; {96660#true} is VALID [2022-04-28 15:35:18,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96660#true} {96660#true} #690#return; {96660#true} is VALID [2022-04-28 15:35:18,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {96660#true} call ULTIMATE.init(); {96666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:35:18,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {96666#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96660#true} is VALID [2022-04-28 15:35:18,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {96660#true} assume true; {96660#true} is VALID [2022-04-28 15:35:18,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96660#true} {96660#true} #690#return; {96660#true} is VALID [2022-04-28 15:35:18,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {96660#true} call #t~ret161 := main(); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {96660#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {96660#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L272 TraceCheckUtils]: 7: Hoare triple {96660#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {96660#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {96660#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {96660#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {96660#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {96660#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {96660#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {96660#true} assume !false; {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {96660#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {96660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {96660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {96660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {96660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {96660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {96660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {96660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {96660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {96660#true} assume 8464 == #t~mem55;havoc #t~mem55; {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {96660#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {96660#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {96660#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {96660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {96660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {96660#true} ~skip~0 := 0; {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {96660#true} assume !false; {96660#true} is VALID [2022-04-28 15:35:18,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {96660#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {96660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {96660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {96660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {96660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {96660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {96660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {96660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {96660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {96660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {96660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {96660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 44: Hoare triple {96660#true} assume 8496 == #t~mem58;havoc #t~mem58; {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {96660#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {96660#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {96660#true} is VALID [2022-04-28 15:35:18,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {96660#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {96660#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {96660#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {96660#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {96660#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {96660#true} ~skip~0 := 0; {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {96660#true} assume !false; {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {96660#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {96660#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {96660#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {96660#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {96660#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {96660#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {96660#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {96660#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {96660#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 63: Hoare triple {96660#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 64: Hoare triple {96660#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {96660#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {96660#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {96660#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 68: Hoare triple {96660#true} assume 8512 == #t~mem60;havoc #t~mem60; {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {96660#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 70: Hoare triple {96660#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {96660#true} is VALID [2022-04-28 15:35:18,370 INFO L290 TraceCheckUtils]: 71: Hoare triple {96660#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,371 INFO L290 TraceCheckUtils]: 72: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(~ret~0 <= 0); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,371 INFO L290 TraceCheckUtils]: 73: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,371 INFO L290 TraceCheckUtils]: 74: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,371 INFO L290 TraceCheckUtils]: 75: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,372 INFO L290 TraceCheckUtils]: 76: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,372 INFO L290 TraceCheckUtils]: 77: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,372 INFO L290 TraceCheckUtils]: 78: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,372 INFO L290 TraceCheckUtils]: 79: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,373 INFO L290 TraceCheckUtils]: 80: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,373 INFO L290 TraceCheckUtils]: 81: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,373 INFO L290 TraceCheckUtils]: 82: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,373 INFO L290 TraceCheckUtils]: 83: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,375 INFO L290 TraceCheckUtils]: 89: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,375 INFO L290 TraceCheckUtils]: 90: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,376 INFO L290 TraceCheckUtils]: 91: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,376 INFO L290 TraceCheckUtils]: 92: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,376 INFO L290 TraceCheckUtils]: 94: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 8528 == #t~mem62;havoc #t~mem62; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,377 INFO L290 TraceCheckUtils]: 95: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,377 INFO L290 TraceCheckUtils]: 96: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,377 INFO L290 TraceCheckUtils]: 97: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,377 INFO L290 TraceCheckUtils]: 98: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != #t~mem106);havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,378 INFO L290 TraceCheckUtils]: 99: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == ~l~0 then 0 else (if 1 == ~l~0 then 0 else ~bitwiseAnd(~l~0, 30))) % 18446744073709551616); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,378 INFO L290 TraceCheckUtils]: 100: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != ~l~0 % 18446744073709551616);~skip~0 := 1; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,378 INFO L290 TraceCheckUtils]: 101: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,378 INFO L290 TraceCheckUtils]: 102: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,379 INFO L290 TraceCheckUtils]: 103: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,379 INFO L290 TraceCheckUtils]: 104: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} ~skip~0 := 0; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,379 INFO L290 TraceCheckUtils]: 105: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !false; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,379 INFO L290 TraceCheckUtils]: 106: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,380 INFO L290 TraceCheckUtils]: 107: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,380 INFO L290 TraceCheckUtils]: 110: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,381 INFO L290 TraceCheckUtils]: 111: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,381 INFO L290 TraceCheckUtils]: 112: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,381 INFO L290 TraceCheckUtils]: 113: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,381 INFO L290 TraceCheckUtils]: 114: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,382 INFO L290 TraceCheckUtils]: 115: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,382 INFO L290 TraceCheckUtils]: 116: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,382 INFO L290 TraceCheckUtils]: 117: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,382 INFO L290 TraceCheckUtils]: 118: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,383 INFO L290 TraceCheckUtils]: 119: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,383 INFO L290 TraceCheckUtils]: 120: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,383 INFO L290 TraceCheckUtils]: 121: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,383 INFO L290 TraceCheckUtils]: 122: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,384 INFO L290 TraceCheckUtils]: 123: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,384 INFO L290 TraceCheckUtils]: 124: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 8544 == #t~mem64;havoc #t~mem64; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,384 INFO L290 TraceCheckUtils]: 125: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,385 INFO L290 TraceCheckUtils]: 126: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,385 INFO L290 TraceCheckUtils]: 127: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,385 INFO L290 TraceCheckUtils]: 128: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,385 INFO L290 TraceCheckUtils]: 129: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,386 INFO L290 TraceCheckUtils]: 130: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {96665#(<= ssl3_accept_~blastFlag~0 6)} is VALID [2022-04-28 15:35:18,386 INFO L290 TraceCheckUtils]: 131: Hoare triple {96665#(<= ssl3_accept_~blastFlag~0 6)} assume 8 == ~blastFlag~0; {96661#false} is VALID [2022-04-28 15:35:18,386 INFO L290 TraceCheckUtils]: 132: Hoare triple {96661#false} assume !false; {96661#false} is VALID [2022-04-28 15:35:18,386 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:35:18,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:18,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631952700] [2022-04-28 15:35:18,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631952700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:18,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:18,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100778301] [2022-04-28 15:35:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100778301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151104052] [2022-04-28 15:35:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:18,387 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:35:18,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:18,388 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:35:18,450 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:35:18,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:35:18,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:18,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:35:18,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:35:18,451 INFO L87 Difference]: Start difference. First operand 984 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:21,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 15:35:26,092 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:35:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:27,595 INFO L93 Difference]: Finished difference Result 2407 states and 3569 transitions. [2022-04-28 15:35:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:35:27,596 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:35:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:27,596 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:35:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:35:27,598 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:35:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2022-04-28 15:35:27,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 607 transitions. [2022-04-28 15:35:27,986 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:35:28,080 INFO L225 Difference]: With dead ends: 2407 [2022-04-28 15:35:28,081 INFO L226 Difference]: Without dead ends: 1451 [2022-04-28 15:35:28,083 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:35:28,088 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 157 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:28,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 380 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 15:35:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2022-04-28 15:35:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1449. [2022-04-28 15:35:28,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:28,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:28,618 INFO L74 IsIncluded]: Start isIncluded. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:28,619 INFO L87 Difference]: Start difference. First operand 1451 states. Second operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:28,668 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-28 15:35:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-28 15:35:28,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:28,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:28,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 15:35:28,671 INFO L87 Difference]: Start difference. First operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1451 states. [2022-04-28 15:35:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:28,721 INFO L93 Difference]: Finished difference Result 1451 states and 2148 transitions. [2022-04-28 15:35:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2148 transitions. [2022-04-28 15:35:28,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:28,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:28,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:28,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1444 states have (on average 1.484072022160665) internal successors, (2143), 1444 states have internal predecessors, (2143), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2147 transitions. [2022-04-28 15:35:28,798 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2147 transitions. Word has length 133 [2022-04-28 15:35:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:28,798 INFO L495 AbstractCegarLoop]: Abstraction has 1449 states and 2147 transitions. [2022-04-28 15:35:28,799 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:35:28,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1449 states and 2147 transitions. [2022-04-28 15:35:30,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2147 edges. 2147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2147 transitions. [2022-04-28 15:35:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 15:35:30,773 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:30,773 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:35:30,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 15:35:30,773 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 1 times [2022-04-28 15:35:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:30,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1221869724] [2022-04-28 15:35:30,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:30,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:30,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1653660413, now seen corresponding path program 2 times [2022-04-28 15:35:30,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:30,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592552593] [2022-04-28 15:35:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:30,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:30,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {107289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {107283#true} is VALID [2022-04-28 15:35:30,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {107283#true} assume true; {107283#true} is VALID [2022-04-28 15:35:30,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107283#true} {107283#true} #690#return; {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {107283#true} call ULTIMATE.init(); {107289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {107289#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {107283#true} assume true; {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107283#true} {107283#true} #690#return; {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {107283#true} call #t~ret161 := main(); {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {107283#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {107283#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L272 TraceCheckUtils]: 7: Hoare triple {107283#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {107283#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {107283#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {107283#true} is VALID [2022-04-28 15:35:30,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {107283#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {107283#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {107283#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {107283#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {107283#true} assume 8464 == #t~mem55;havoc #t~mem55; {107283#true} is VALID [2022-04-28 15:35:30,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {107283#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {107283#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {107283#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {107283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {107283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {107283#true} ~skip~0 := 0; {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 34: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 35: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 36: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {107283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {107283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {107283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {107283#true} assume 8496 == #t~mem58;havoc #t~mem58; {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {107283#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {107283#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {107283#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {107283#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {107283#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {107283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 51: Hoare triple {107283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {107283#true} ~skip~0 := 0; {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 56: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 62: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 63: Hoare triple {107283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 64: Hoare triple {107283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {107283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {107283#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {107283#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {107283#true} assume 8512 == #t~mem60;havoc #t~mem60; {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {107283#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {107283#true} is VALID [2022-04-28 15:35:30,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {107283#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 71: Hoare triple {107283#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 72: Hoare triple {107283#true} assume !(~ret~0 <= 0); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {107283#true} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {107283#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 75: Hoare triple {107283#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 76: Hoare triple {107283#true} ~skip~0 := 0; {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 77: Hoare triple {107283#true} assume !false; {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 78: Hoare triple {107283#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 79: Hoare triple {107283#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 80: Hoare triple {107283#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 81: Hoare triple {107283#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 82: Hoare triple {107283#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 83: Hoare triple {107283#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 84: Hoare triple {107283#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {107283#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {107283#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 87: Hoare triple {107283#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 88: Hoare triple {107283#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 89: Hoare triple {107283#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 90: Hoare triple {107283#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 91: Hoare triple {107283#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 92: Hoare triple {107283#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 93: Hoare triple {107283#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 94: Hoare triple {107283#true} assume 8528 == #t~mem62;havoc #t~mem62; {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 95: Hoare triple {107283#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 888 + #t~mem99.offset, 8);call #t~mem101 := read~int(#t~mem100.base, 20 + #t~mem100.offset, 8);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 332 + ~s.offset, 8); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 96: Hoare triple {107283#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 18446744073709551616;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem103.base, 935 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 97: Hoare triple {107283#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem106 := read~int(#t~mem105.base, 935 + #t~mem105.offset, 4); {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {107283#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {107283#true} is VALID [2022-04-28 15:35:30,973 INFO L290 TraceCheckUtils]: 99: Hoare triple {107283#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {107283#true} is VALID [2022-04-28 15:35:30,974 INFO L290 TraceCheckUtils]: 100: Hoare triple {107283#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,974 INFO L290 TraceCheckUtils]: 101: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(~ret~0 <= 0); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call write~int(8544, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,974 INFO L290 TraceCheckUtils]: 103: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,975 INFO L290 TraceCheckUtils]: 104: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,975 INFO L290 TraceCheckUtils]: 105: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} ~skip~0 := 0; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,975 INFO L290 TraceCheckUtils]: 106: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !false; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,975 INFO L290 TraceCheckUtils]: 107: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,976 INFO L290 TraceCheckUtils]: 108: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,976 INFO L290 TraceCheckUtils]: 109: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,976 INFO L290 TraceCheckUtils]: 110: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,977 INFO L290 TraceCheckUtils]: 111: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,977 INFO L290 TraceCheckUtils]: 112: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,977 INFO L290 TraceCheckUtils]: 113: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,977 INFO L290 TraceCheckUtils]: 114: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,978 INFO L290 TraceCheckUtils]: 115: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,978 INFO L290 TraceCheckUtils]: 116: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,978 INFO L290 TraceCheckUtils]: 117: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,978 INFO L290 TraceCheckUtils]: 118: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,979 INFO L290 TraceCheckUtils]: 119: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,979 INFO L290 TraceCheckUtils]: 120: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,979 INFO L290 TraceCheckUtils]: 121: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,979 INFO L290 TraceCheckUtils]: 122: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,980 INFO L290 TraceCheckUtils]: 123: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,980 INFO L290 TraceCheckUtils]: 124: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,980 INFO L290 TraceCheckUtils]: 125: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume 8544 == #t~mem64;havoc #t~mem64; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,980 INFO L290 TraceCheckUtils]: 126: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem116 := read~int(~s.base, 256 + ~s.offset, 4); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,981 INFO L290 TraceCheckUtils]: 127: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 152 + #t~mem117.offset, 8); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,981 INFO L290 TraceCheckUtils]: 128: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 18446744073709551616);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,981 INFO L290 TraceCheckUtils]: 129: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 888 + #t~mem121.offset, 8);call #t~mem123 := read~int(#t~mem122.base, 20 + #t~mem122.offset, 8); {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,981 INFO L290 TraceCheckUtils]: 130: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 18446744073709551616);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,982 INFO L290 TraceCheckUtils]: 131: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(1, #t~mem126.base, 975 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {107288#(<= ssl3_accept_~blastFlag~0 7)} is VALID [2022-04-28 15:35:30,982 INFO L290 TraceCheckUtils]: 132: Hoare triple {107288#(<= ssl3_accept_~blastFlag~0 7)} assume 8 == ~blastFlag~0; {107284#false} is VALID [2022-04-28 15:35:30,982 INFO L290 TraceCheckUtils]: 133: Hoare triple {107284#false} assume !false; {107284#false} is VALID [2022-04-28 15:35:30,982 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:35:30,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592552593] [2022-04-28 15:35:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592552593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:30,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:30,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:30,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1221869724] [2022-04-28 15:35:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1221869724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:30,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:30,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390876732] [2022-04-28 15:35:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:30,983 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:35:30,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:30,984 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:35:31,047 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:35:31,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:35:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:31,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:35:31,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:35:31,048 INFO L87 Difference]: Start difference. First operand 1449 states and 2147 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:33,062 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:35:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:34,712 INFO L93 Difference]: Finished difference Result 1918 states and 2847 transitions. [2022-04-28 15:35:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:35:34,712 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:35:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:34,712 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:35:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:35:34,715 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:35:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-04-28 15:35:34,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 412 transitions. [2022-04-28 15:35:34,891 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:35:35,051 INFO L225 Difference]: With dead ends: 1918 [2022-04-28 15:35:35,051 INFO L226 Difference]: Without dead ends: 1916 [2022-04-28 15:35:35,051 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:35:35,052 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:35,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 15:35:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2022-04-28 15:35:35,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2022-04-28 15:35:35,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:35,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1916 states. Second operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:35,743 INFO L74 IsIncluded]: Start isIncluded. First operand 1916 states. Second operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:35,744 INFO L87 Difference]: Start difference. First operand 1916 states. Second operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:35,835 INFO L93 Difference]: Finished difference Result 1916 states and 2845 transitions. [2022-04-28 15:35:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2845 transitions. [2022-04-28 15:35:35,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:35,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:35,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1916 states. [2022-04-28 15:35:35,840 INFO L87 Difference]: Start difference. First operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1916 states. [2022-04-28 15:35:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:35,931 INFO L93 Difference]: Finished difference Result 1916 states and 2845 transitions. [2022-04-28 15:35:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2845 transitions. [2022-04-28 15:35:35,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:35,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:35,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:35,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1909 states have (on average 1.4876898899947617) internal successors, (2840), 1909 states have internal predecessors, (2840), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2844 transitions. [2022-04-28 15:35:36,087 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2844 transitions. Word has length 134 [2022-04-28 15:35:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:36,087 INFO L495 AbstractCegarLoop]: Abstraction has 1914 states and 2844 transitions. [2022-04-28 15:35:36,087 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:35:36,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1914 states and 2844 transitions. [2022-04-28 15:35:38,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2844 edges. 2844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2844 transitions. [2022-04-28 15:35:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 15:35:38,102 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:38,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:38,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 15:35:38,103 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2033004629, now seen corresponding path program 1 times [2022-04-28 15:35:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:38,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669220025] [2022-04-28 15:35:38,165 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:38,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2033004629, now seen corresponding path program 2 times [2022-04-28 15:35:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:38,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114232565] [2022-04-28 15:35:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:38,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:38,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {118794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {118788#true} is VALID [2022-04-28 15:35:38,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {118788#true} assume true; {118788#true} is VALID [2022-04-28 15:35:38,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118788#true} {118788#true} #690#return; {118788#true} is VALID [2022-04-28 15:35:38,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {118788#true} call ULTIMATE.init(); {118794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {118794#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {118788#true} assume true; {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118788#true} {118788#true} #690#return; {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {118788#true} call #t~ret161 := main(); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {118788#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {118788#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L272 TraceCheckUtils]: 7: Hoare triple {118788#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {118788#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {118788#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {118788#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {118788#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {118788#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {118788#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {118788#true} is VALID [2022-04-28 15:35:38,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {118788#true} assume !false; {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {118788#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {118788#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {118788#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {118788#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {118788#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {118788#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {118788#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {118788#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {118788#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {118788#true} assume 8464 == #t~mem55;havoc #t~mem55; {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {118788#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {118788#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {118788#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {118788#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {118788#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {118788#true} ~skip~0 := 0; {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {118788#true} assume !false; {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {118788#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {118788#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {118788#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {118788#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {118788#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {118788#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {118788#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {118788#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {118788#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {118788#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {118788#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {118788#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {118788#true} assume 8496 == #t~mem58;havoc #t~mem58; {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {118788#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {118788#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {118788#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {118788#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {118788#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {118788#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {118788#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {118788#true} ~skip~0 := 0; {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {118788#true} assume !false; {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {118788#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {118788#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {118788#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {118788#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {118788#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {118788#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {118788#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {118788#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {118788#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {118788#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {118788#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 65: Hoare triple {118788#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 66: Hoare triple {118788#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 67: Hoare triple {118788#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 68: Hoare triple {118788#true} assume 8512 == #t~mem60;havoc #t~mem60; {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 69: Hoare triple {118788#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 888 + #t~mem95.offset, 8);call #t~mem97 := read~int(#t~mem96.base, 20 + #t~mem96.offset, 8); {118788#true} is VALID [2022-04-28 15:35:38,282 INFO L290 TraceCheckUtils]: 70: Hoare triple {118788#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 18446744073709551616);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {118788#true} is VALID [2022-04-28 15:35:38,283 INFO L290 TraceCheckUtils]: 71: Hoare triple {118788#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 6; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,283 INFO L290 TraceCheckUtils]: 75: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !false; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,285 INFO L290 TraceCheckUtils]: 80: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,285 INFO L290 TraceCheckUtils]: 81: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,285 INFO L290 TraceCheckUtils]: 82: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,285 INFO L290 TraceCheckUtils]: 83: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,286 INFO L290 TraceCheckUtils]: 84: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,286 INFO L290 TraceCheckUtils]: 85: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,286 INFO L290 TraceCheckUtils]: 86: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,286 INFO L290 TraceCheckUtils]: 87: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,287 INFO L290 TraceCheckUtils]: 88: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,287 INFO L290 TraceCheckUtils]: 89: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,287 INFO L290 TraceCheckUtils]: 90: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,287 INFO L290 TraceCheckUtils]: 91: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,288 INFO L290 TraceCheckUtils]: 92: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,288 INFO L290 TraceCheckUtils]: 93: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,288 INFO L290 TraceCheckUtils]: 94: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,288 INFO L290 TraceCheckUtils]: 95: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,288 INFO L290 TraceCheckUtils]: 96: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,289 INFO L290 TraceCheckUtils]: 97: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,289 INFO L290 TraceCheckUtils]: 98: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,289 INFO L290 TraceCheckUtils]: 99: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,289 INFO L290 TraceCheckUtils]: 100: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,290 INFO L290 TraceCheckUtils]: 101: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,290 INFO L290 TraceCheckUtils]: 102: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,296 INFO L290 TraceCheckUtils]: 103: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,297 INFO L290 TraceCheckUtils]: 104: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,297 INFO L290 TraceCheckUtils]: 105: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,297 INFO L290 TraceCheckUtils]: 106: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume 8609 == #t~mem74;havoc #t~mem74; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 107: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {118793#(<= 6 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 108: Hoare triple {118793#(<= 6 ssl3_accept_~blastFlag~0)} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 109: Hoare triple {118789#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 110: Hoare triple {118789#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 111: Hoare triple {118789#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 112: Hoare triple {118789#false} ~skip~0 := 0; {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 113: Hoare triple {118789#false} assume !false; {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 114: Hoare triple {118789#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 115: Hoare triple {118789#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 116: Hoare triple {118789#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,298 INFO L290 TraceCheckUtils]: 117: Hoare triple {118789#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 118: Hoare triple {118789#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 119: Hoare triple {118789#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 120: Hoare triple {118789#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 121: Hoare triple {118789#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 122: Hoare triple {118789#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 123: Hoare triple {118789#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 124: Hoare triple {118789#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 125: Hoare triple {118789#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 126: Hoare triple {118789#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 127: Hoare triple {118789#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 128: Hoare triple {118789#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 129: Hoare triple {118789#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 130: Hoare triple {118789#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 131: Hoare triple {118789#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,299 INFO L290 TraceCheckUtils]: 132: Hoare triple {118789#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 133: Hoare triple {118789#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 134: Hoare triple {118789#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 135: Hoare triple {118789#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 136: Hoare triple {118789#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 137: Hoare triple {118789#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 138: Hoare triple {118789#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 139: Hoare triple {118789#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 140: Hoare triple {118789#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 141: Hoare triple {118789#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 142: Hoare triple {118789#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 143: Hoare triple {118789#false} assume 8640 == #t~mem75;havoc #t~mem75; {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 144: Hoare triple {118789#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 145: Hoare triple {118789#false} assume 4 == ~blastFlag~0; {118789#false} is VALID [2022-04-28 15:35:38,300 INFO L290 TraceCheckUtils]: 146: Hoare triple {118789#false} assume !false; {118789#false} is VALID [2022-04-28 15:35:38,301 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:35:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:38,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114232565] [2022-04-28 15:35:38,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114232565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:38,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:38,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:38,301 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:38,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669220025] [2022-04-28 15:35:38,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669220025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:38,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:38,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 15:35:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658532375] [2022-04-28 15:35:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:38,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-28 15:35:38,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:38,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:38,387 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:35:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 15:35:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 15:35:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 15:35:38,388 INFO L87 Difference]: Start difference. First operand 1914 states and 2844 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:40,403 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:35:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:43,818 INFO L93 Difference]: Finished difference Result 4267 states and 6353 transitions. [2022-04-28 15:35:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 15:35:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-28 15:35:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:35:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:35:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2022-04-28 15:35:43,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 605 transitions. [2022-04-28 15:35:44,215 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:35:44,446 INFO L225 Difference]: With dead ends: 4267 [2022-04-28 15:35:44,446 INFO L226 Difference]: Without dead ends: 2381 [2022-04-28 15:35:44,448 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:35:44,449 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 151 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:35:44,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 576 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 425 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 15:35:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2022-04-28 15:35:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2379. [2022-04-28 15:35:46,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:35:46,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2381 states. Second operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:46,874 INFO L74 IsIncluded]: Start isIncluded. First operand 2381 states. Second operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:46,875 INFO L87 Difference]: Start difference. First operand 2381 states. Second operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:47,018 INFO L93 Difference]: Finished difference Result 2381 states and 3520 transitions. [2022-04-28 15:35:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3520 transitions. [2022-04-28 15:35:47,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:47,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:47,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2381 states. [2022-04-28 15:35:47,023 INFO L87 Difference]: Start difference. First operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2381 states. [2022-04-28 15:35:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:35:47,160 INFO L93 Difference]: Finished difference Result 2381 states and 3520 transitions. [2022-04-28 15:35:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3520 transitions. [2022-04-28 15:35:47,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:35:47,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:35:47,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:35:47,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:35:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2374 states have (on average 1.4806234203875317) internal successors, (3515), 2374 states have internal predecessors, (3515), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:47,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3519 transitions. [2022-04-28 15:35:47,420 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3519 transitions. Word has length 147 [2022-04-28 15:35:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:35:47,420 INFO L495 AbstractCegarLoop]: Abstraction has 2379 states and 3519 transitions. [2022-04-28 15:35:47,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 3 states have internal predecessors, (117), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:47,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2379 states and 3519 transitions. [2022-04-28 15:35:50,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3519 edges. 3519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3519 transitions. [2022-04-28 15:35:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-28 15:35:50,257 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:35:50,257 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, 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:35:50,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 15:35:50,257 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:35:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:35:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2118197421, now seen corresponding path program 1 times [2022-04-28 15:35:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:50,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [158608637] [2022-04-28 15:35:50,327 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:35:50,327 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:35:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2118197421, now seen corresponding path program 2 times [2022-04-28 15:35:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:35:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875673865] [2022-04-28 15:35:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:35:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:35:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:35:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:35:50,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {136858#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {136851#true} is VALID [2022-04-28 15:35:50,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {136851#true} assume true; {136851#true} is VALID [2022-04-28 15:35:50,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136851#true} {136851#true} #690#return; {136851#true} is VALID [2022-04-28 15:35:50,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {136851#true} call ULTIMATE.init(); {136858#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:35:50,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {136858#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {136851#true} is VALID [2022-04-28 15:35:50,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {136851#true} assume true; {136851#true} is VALID [2022-04-28 15:35:50,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136851#true} {136851#true} #690#return; {136851#true} is VALID [2022-04-28 15:35:50,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {136851#true} call #t~ret161 := main(); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {136851#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {136851#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L272 TraceCheckUtils]: 7: Hoare triple {136851#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {136851#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {136851#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {136851#true} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {136851#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {136851#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {136851#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {136851#true} assume !false; {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {136851#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {136851#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {136851#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {136851#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {136851#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {136851#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {136851#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {136851#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {136851#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {136851#true} assume 8464 == #t~mem55;havoc #t~mem55; {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {136851#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {136851#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {136851#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {136851#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {136851#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {136851#true} ~skip~0 := 0; {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {136851#true} assume !false; {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {136851#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {136851#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 34: Hoare triple {136851#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {136851#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {136851#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {136851#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {136851#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {136851#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {136851#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 41: Hoare triple {136851#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {136851#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 43: Hoare triple {136851#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {136851#true} assume 8496 == #t~mem58;havoc #t~mem58; {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {136851#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {136851#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {136851#true} is VALID [2022-04-28 15:35:50,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {136851#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {136851#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {136851#true} call write~int(0, ~s.base, 88 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {136851#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {136851#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {136851#true} ~skip~0 := 0; {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {136851#true} assume !false; {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {136851#true} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {136851#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {136851#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 57: Hoare triple {136851#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {136851#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {136851#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {136851#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {136851#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {136851#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {136851#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {136851#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {136851#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {136851#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 67: Hoare triple {136851#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 68: Hoare triple {136851#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 69: Hoare triple {136851#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 70: Hoare triple {136851#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 71: Hoare triple {136851#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 72: Hoare triple {136851#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 73: Hoare triple {136851#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 74: Hoare triple {136851#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 75: Hoare triple {136851#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 76: Hoare triple {136851#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {136851#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 78: Hoare triple {136851#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 79: Hoare triple {136851#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 80: Hoare triple {136851#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 81: Hoare triple {136851#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 82: Hoare triple {136851#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 83: Hoare triple {136851#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 84: Hoare triple {136851#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {136851#true} is VALID [2022-04-28 15:35:50,467 INFO L290 TraceCheckUtils]: 85: Hoare triple {136851#true} assume 8656 == #t~mem77;havoc #t~mem77; {136851#true} is VALID [2022-04-28 15:35:50,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {136851#true} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {136851#true} is VALID [2022-04-28 15:35:50,468 INFO L290 TraceCheckUtils]: 87: Hoare triple {136851#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {136851#true} is VALID [2022-04-28 15:35:50,468 INFO L290 TraceCheckUtils]: 88: Hoare triple {136851#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {136851#true} is VALID [2022-04-28 15:35:50,469 INFO L290 TraceCheckUtils]: 89: Hoare triple {136851#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,469 INFO L290 TraceCheckUtils]: 90: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(0 == ~tmp___10~0); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,470 INFO L290 TraceCheckUtils]: 91: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,470 INFO L290 TraceCheckUtils]: 92: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,470 INFO L290 TraceCheckUtils]: 93: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} ~skip~0 := 0; {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,471 INFO L290 TraceCheckUtils]: 94: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !false; {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,471 INFO L290 TraceCheckUtils]: 95: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,472 INFO L290 TraceCheckUtils]: 98: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,472 INFO L290 TraceCheckUtils]: 99: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,472 INFO L290 TraceCheckUtils]: 100: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,473 INFO L290 TraceCheckUtils]: 102: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,474 INFO L290 TraceCheckUtils]: 104: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,474 INFO L290 TraceCheckUtils]: 105: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,474 INFO L290 TraceCheckUtils]: 106: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,475 INFO L290 TraceCheckUtils]: 107: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,475 INFO L290 TraceCheckUtils]: 108: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,475 INFO L290 TraceCheckUtils]: 109: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,476 INFO L290 TraceCheckUtils]: 110: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,476 INFO L290 TraceCheckUtils]: 111: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,476 INFO L290 TraceCheckUtils]: 112: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,477 INFO L290 TraceCheckUtils]: 113: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,477 INFO L290 TraceCheckUtils]: 114: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,477 INFO L290 TraceCheckUtils]: 115: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,478 INFO L290 TraceCheckUtils]: 117: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,478 INFO L290 TraceCheckUtils]: 118: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,479 INFO L290 TraceCheckUtils]: 119: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,479 INFO L290 TraceCheckUtils]: 120: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,479 INFO L290 TraceCheckUtils]: 121: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 122: Hoare triple {136856#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)) 8672)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136857#(= |ssl3_accept_#t~mem74| 8672)} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 123: Hoare triple {136857#(= |ssl3_accept_#t~mem74| 8672)} assume 8609 == #t~mem74;havoc #t~mem74; {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 124: Hoare triple {136852#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 125: Hoare triple {136852#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 126: Hoare triple {136852#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 127: Hoare triple {136852#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 128: Hoare triple {136852#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 129: Hoare triple {136852#false} ~skip~0 := 0; {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 130: Hoare triple {136852#false} assume !false; {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 131: Hoare triple {136852#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,480 INFO L290 TraceCheckUtils]: 132: Hoare triple {136852#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 133: Hoare triple {136852#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 134: Hoare triple {136852#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 135: Hoare triple {136852#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 136: Hoare triple {136852#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 137: Hoare triple {136852#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 138: Hoare triple {136852#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 139: Hoare triple {136852#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 140: Hoare triple {136852#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 141: Hoare triple {136852#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 142: Hoare triple {136852#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 143: Hoare triple {136852#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 144: Hoare triple {136852#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 145: Hoare triple {136852#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 146: Hoare triple {136852#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,481 INFO L290 TraceCheckUtils]: 147: Hoare triple {136852#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 148: Hoare triple {136852#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 149: Hoare triple {136852#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 150: Hoare triple {136852#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 151: Hoare triple {136852#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 152: Hoare triple {136852#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 153: Hoare triple {136852#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 154: Hoare triple {136852#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 155: Hoare triple {136852#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 156: Hoare triple {136852#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 157: Hoare triple {136852#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 158: Hoare triple {136852#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 159: Hoare triple {136852#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 160: Hoare triple {136852#false} assume 8640 == #t~mem75;havoc #t~mem75; {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 161: Hoare triple {136852#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {136852#false} is VALID [2022-04-28 15:35:50,482 INFO L290 TraceCheckUtils]: 162: Hoare triple {136852#false} assume 4 == ~blastFlag~0; {136852#false} is VALID [2022-04-28 15:35:50,483 INFO L290 TraceCheckUtils]: 163: Hoare triple {136852#false} assume !false; {136852#false} is VALID [2022-04-28 15:35:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:35:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:35:50,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875673865] [2022-04-28 15:35:50,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875673865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:50,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:50,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:50,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:35:50,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [158608637] [2022-04-28 15:35:50,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [158608637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:35:50,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:35:50,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 15:35:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418210927] [2022-04-28 15:35:50,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:35:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-28 15:35:50,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:35:50,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:50,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:35:50,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 15:35:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:35:50,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 15:35:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 15:35:50,570 INFO L87 Difference]: Start difference. First operand 2379 states and 3519 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:35:53,531 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:36:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:03,317 INFO L93 Difference]: Finished difference Result 5009 states and 7394 transitions. [2022-04-28 15:36:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 15:36:03,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2022-04-28 15:36:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-28 15:36:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 510 transitions. [2022-04-28 15:36:03,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 510 transitions. [2022-04-28 15:36:03,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 510 edges. 510 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:03,811 INFO L225 Difference]: With dead ends: 5009 [2022-04-28 15:36:03,811 INFO L226 Difference]: Without dead ends: 2658 [2022-04-28 15:36:03,813 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:36:03,814 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 53 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:03,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 626 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 15:36:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2022-04-28 15:36:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2531. [2022-04-28 15:36:05,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:05,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2658 states. Second operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:05,505 INFO L74 IsIncluded]: Start isIncluded. First operand 2658 states. Second operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:05,507 INFO L87 Difference]: Start difference. First operand 2658 states. Second operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:05,684 INFO L93 Difference]: Finished difference Result 2658 states and 3903 transitions. [2022-04-28 15:36:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3903 transitions. [2022-04-28 15:36:05,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:05,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:05,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2658 states. [2022-04-28 15:36:05,690 INFO L87 Difference]: Start difference. First operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2658 states. [2022-04-28 15:36:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:05,870 INFO L93 Difference]: Finished difference Result 2658 states and 3903 transitions. [2022-04-28 15:36:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3903 transitions. [2022-04-28 15:36:05,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:05,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:05,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:05,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2526 states have (on average 1.4817893903404593) internal successors, (3743), 2526 states have internal predecessors, (3743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3747 transitions. [2022-04-28 15:36:06,152 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3747 transitions. Word has length 164 [2022-04-28 15:36:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:06,152 INFO L495 AbstractCegarLoop]: Abstraction has 2531 states and 3747 transitions. [2022-04-28 15:36:06,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:06,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2531 states and 3747 transitions. [2022-04-28 15:36:09,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3747 edges. 3747 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3747 transitions. [2022-04-28 15:36:09,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:36:09,516 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:09,516 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:36:09,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 15:36:09,516 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash -210905305, now seen corresponding path program 1 times [2022-04-28 15:36:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:09,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [514119134] [2022-04-28 15:36:09,623 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:09,623 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:09,623 INFO L85 PathProgramCache]: Analyzing trace with hash -210905305, now seen corresponding path program 2 times [2022-04-28 15:36:09,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:09,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270549519] [2022-04-28 15:36:09,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:09,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:10,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {157268#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {157259#true} is VALID [2022-04-28 15:36:10,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {157259#true} assume true; {157259#true} is VALID [2022-04-28 15:36:10,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157259#true} {157259#true} #690#return; {157259#true} is VALID [2022-04-28 15:36:10,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {157259#true} call ULTIMATE.init(); {157268#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:36:10,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {157268#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {157259#true} is VALID [2022-04-28 15:36:10,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {157259#true} assume true; {157259#true} is VALID [2022-04-28 15:36:10,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157259#true} {157259#true} #690#return; {157259#true} is VALID [2022-04-28 15:36:10,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {157259#true} call #t~ret161 := main(); {157259#true} is VALID [2022-04-28 15:36:10,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {157259#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {157259#true} is VALID [2022-04-28 15:36:10,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {157259#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 204 + ~s~0.offset, 8); {157264#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} is VALID [2022-04-28 15:36:10,114 INFO L272 TraceCheckUtils]: 7: Hoare triple {157264#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 204)) 0) (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 204))))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {157265#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} is VALID [2022-04-28 15:36:10,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {157265#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ 204 |ssl3_accept_#in~s.offset|)) 0))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:36:10,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:36:10,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:36:10,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {157266#(and (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0) (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 204)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {157267#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {157267#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {157260#false} assume 8464 == #t~mem55;havoc #t~mem55; {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {157260#false} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {157260#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {157260#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 40: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 43: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {157260#false} assume 8496 == #t~mem58;havoc #t~mem58; {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {157260#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {157260#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {157260#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {157260#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {157260#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 54: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 58: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 59: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 60: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 61: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 62: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 63: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,121 INFO L290 TraceCheckUtils]: 65: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 66: Hoare triple {157260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {157260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 68: Hoare triple {157260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {157260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 70: Hoare triple {157260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 71: Hoare triple {157260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {157260#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 73: Hoare triple {157260#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 74: Hoare triple {157260#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 75: Hoare triple {157260#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 76: Hoare triple {157260#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {157260#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 78: Hoare triple {157260#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {157260#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {157260#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {157260#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 82: Hoare triple {157260#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {157260#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 84: Hoare triple {157260#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 85: Hoare triple {157260#false} assume 8656 == #t~mem77;havoc #t~mem77; {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 86: Hoare triple {157260#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 87: Hoare triple {157260#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 88: Hoare triple {157260#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 89: Hoare triple {157260#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 90: Hoare triple {157260#false} assume !(0 == ~tmp___10~0); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 91: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 92: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-28 15:36:10,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 95: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 96: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 97: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 98: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 99: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 100: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 102: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 103: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 104: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 105: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 106: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 107: Hoare triple {157260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 108: Hoare triple {157260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,124 INFO L290 TraceCheckUtils]: 109: Hoare triple {157260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 110: Hoare triple {157260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 111: Hoare triple {157260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 112: Hoare triple {157260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 113: Hoare triple {157260#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 114: Hoare triple {157260#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 115: Hoare triple {157260#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 116: Hoare triple {157260#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 117: Hoare triple {157260#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 118: Hoare triple {157260#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 119: Hoare triple {157260#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 120: Hoare triple {157260#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 121: Hoare triple {157260#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 122: Hoare triple {157260#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 123: Hoare triple {157260#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,125 INFO L290 TraceCheckUtils]: 124: Hoare triple {157260#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 125: Hoare triple {157260#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 126: Hoare triple {157260#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 127: Hoare triple {157260#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 128: Hoare triple {157260#false} assume 8672 == #t~mem79;havoc #t~mem79; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 129: Hoare triple {157260#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 130: Hoare triple {157260#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 131: Hoare triple {157260#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 132: Hoare triple {157260#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 133: Hoare triple {157260#false} call write~int(0, ~s.base, 88 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 134: Hoare triple {157260#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 135: Hoare triple {157260#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 136: Hoare triple {157260#false} ~skip~0 := 0; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 137: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 138: Hoare triple {157260#false} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,126 INFO L290 TraceCheckUtils]: 139: Hoare triple {157260#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 140: Hoare triple {157260#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 141: Hoare triple {157260#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 142: Hoare triple {157260#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 143: Hoare triple {157260#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 144: Hoare triple {157260#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 145: Hoare triple {157260#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 146: Hoare triple {157260#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 147: Hoare triple {157260#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 148: Hoare triple {157260#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 149: Hoare triple {157260#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 150: Hoare triple {157260#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 151: Hoare triple {157260#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 152: Hoare triple {157260#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 153: Hoare triple {157260#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,127 INFO L290 TraceCheckUtils]: 154: Hoare triple {157260#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 155: Hoare triple {157260#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 156: Hoare triple {157260#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 157: Hoare triple {157260#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 158: Hoare triple {157260#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 159: Hoare triple {157260#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 160: Hoare triple {157260#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 161: Hoare triple {157260#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 162: Hoare triple {157260#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 163: Hoare triple {157260#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 164: Hoare triple {157260#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 165: Hoare triple {157260#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 166: Hoare triple {157260#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 167: Hoare triple {157260#false} assume 8640 == #t~mem75;havoc #t~mem75; {157260#false} is VALID [2022-04-28 15:36:10,128 INFO L290 TraceCheckUtils]: 168: Hoare triple {157260#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {157260#false} is VALID [2022-04-28 15:36:10,129 INFO L290 TraceCheckUtils]: 169: Hoare triple {157260#false} assume 4 == ~blastFlag~0; {157260#false} is VALID [2022-04-28 15:36:10,129 INFO L290 TraceCheckUtils]: 170: Hoare triple {157260#false} assume !false; {157260#false} is VALID [2022-04-28 15:36:10,129 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:36:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270549519] [2022-04-28 15:36:10,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270549519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:10,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:10,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:36:10,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 15:36:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [514119134] [2022-04-28 15:36:10,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [514119134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 15:36:10,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 15:36:10,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 15:36:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583272972] [2022-04-28 15:36:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 15:36:10,130 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:36:10,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 15:36:10,130 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:36:10,186 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:36:10,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 15:36:10,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:10,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 15:36:10,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 15:36:10,187 INFO L87 Difference]: Start difference. First operand 2531 states and 3747 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:12,210 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:36:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:15,996 INFO L93 Difference]: Finished difference Result 5055 states and 7486 transitions. [2022-04-28 15:36:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 15:36:15,996 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:36:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 15:36:15,997 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:36:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:36:15,999 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:36:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 422 transitions. [2022-04-28 15:36:16,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 422 transitions. [2022-04-28 15:36:16,172 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:36:16,494 INFO L225 Difference]: With dead ends: 5055 [2022-04-28 15:36:16,494 INFO L226 Difference]: Without dead ends: 2531 [2022-04-28 15:36:16,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 15:36:16,498 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 15:36:16,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 841 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 15:36:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2022-04-28 15:36:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2531. [2022-04-28 15:36:17,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 15:36:17,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2531 states. Second operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:17,937 INFO L74 IsIncluded]: Start isIncluded. First operand 2531 states. Second operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:17,938 INFO L87 Difference]: Start difference. First operand 2531 states. Second operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:18,097 INFO L93 Difference]: Finished difference Result 2531 states and 3746 transitions. [2022-04-28 15:36:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3746 transitions. [2022-04-28 15:36:18,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:18,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:18,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2531 states. [2022-04-28 15:36:18,102 INFO L87 Difference]: Start difference. First operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2531 states. [2022-04-28 15:36:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 15:36:18,260 INFO L93 Difference]: Finished difference Result 2531 states and 3746 transitions. [2022-04-28 15:36:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3746 transitions. [2022-04-28 15:36:18,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 15:36:18,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 15:36:18,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 15:36:18,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 15:36:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2526 states have (on average 1.4813935075217735) internal successors, (3742), 2526 states have internal predecessors, (3742), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 15:36:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3746 transitions. [2022-04-28 15:36:18,529 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3746 transitions. Word has length 171 [2022-04-28 15:36:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 15:36:18,529 INFO L495 AbstractCegarLoop]: Abstraction has 2531 states and 3746 transitions. [2022-04-28 15:36:18,529 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:36:18,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2531 states and 3746 transitions. [2022-04-28 15:36:21,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3746 edges. 3746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 15:36:21,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3746 transitions. [2022-04-28 15:36:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-28 15:36:21,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 15:36:21,879 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:36:21,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 15:36:21,879 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 15:36:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 15:36:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2134155735, now seen corresponding path program 1 times [2022-04-28 15:36:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 15:36:21,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1632567408] [2022-04-28 15:36:22,008 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 15:36:22,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 15:36:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2134155735, now seen corresponding path program 2 times [2022-04-28 15:36:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 15:36:22,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949838476] [2022-04-28 15:36:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 15:36:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 15:36:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 15:36:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:36:22,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {177524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {177511#true} is VALID [2022-04-28 15:36:22,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {177511#true} assume true; {177511#true} is VALID [2022-04-28 15:36:22,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177511#true} {177511#true} #690#return; {177511#true} is VALID [2022-04-28 15:36:22,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {177511#true} call ULTIMATE.init(); {177524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 15:36:22,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {177524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(196, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {177511#true} is VALID [2022-04-28 15:36:22,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {177511#true} assume true; {177511#true} is VALID [2022-04-28 15:36:22,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177511#true} {177511#true} #690#return; {177511#true} is VALID [2022-04-28 15:36:22,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {177511#true} call #t~ret161 := main(); {177511#true} is VALID [2022-04-28 15:36:22,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {177511#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet11 % 18446744073709551616 % 18446744073709551616 else #t~nondet11 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 332 + ~s~0.offset, 8);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 256 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 248 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem14.base, 152 + #t~mem14.offset, 8);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 975 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 888 + #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 888 + #t~mem20.offset, 8);call write~int(#t~nondet22, #t~mem21.base, 20 + #t~mem21.offset, 8);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 888 + #t~mem23.offset, 8);call write~int(#t~nondet25, #t~mem24.base, 28 + #t~mem24.offset, 8);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {177516#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (= (select |#valid| main_~s~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} is VALID [2022-04-28 15:36:22,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {177516#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (= (select |#valid| main_~s~0.base) 1) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} assume !(0 != #t~nondet26);havoc #t~nondet26;call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(144);call write~$Pointer$(#t~malloc27.base, #t~malloc27.offset, ~s~0.base, 204 + ~s~0.offset, 8);havoc #t~malloc27.base, #t~malloc27.offset;call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet29 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet29 % 18446744073709551616 % 18446744073709551616 else #t~nondet29 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem28.base, 68 + #t~mem28.offset, 8);havoc #t~mem28.base, #t~mem28.offset;havoc #t~nondet29; {177517#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} is VALID [2022-04-28 15:36:22,840 INFO L272 TraceCheckUtils]: 7: Hoare triple {177517#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ 116 main_~s~0.offset)) main_~s~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 248)) main_~s~0.base)))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {177518#(and (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)))))} is VALID [2022-04-28 15:36:22,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {177518#(and (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 248)))) (not (= |ssl3_accept_#in~s.base| (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ 116 |ssl3_accept_#in~s.offset|)))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -9223372036854775808 <= #t~nondet37 && #t~nondet37 <= 9223372036854775807;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 72 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 18446744073709551616;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem44 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 44 + ~s.offset, 4);havoc #t~mem44; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 8); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 18446744073709551616);havoc #t~mem45.base, #t~mem45.offset; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !false; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,846 INFO L290 TraceCheckUtils]: 15: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 8464 == #t~mem55;havoc #t~mem55; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} ~skip~0 := 0; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !false; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 8496 == #t~mem58;havoc #t~mem58; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 128 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} ~skip~0 := 0; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !false; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,871 INFO L290 TraceCheckUtils]: 61: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,872 INFO L290 TraceCheckUtils]: 63: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,873 INFO L290 TraceCheckUtils]: 65: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,874 INFO L290 TraceCheckUtils]: 67: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,875 INFO L290 TraceCheckUtils]: 69: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,876 INFO L290 TraceCheckUtils]: 72: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,880 INFO L290 TraceCheckUtils]: 79: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,882 INFO L290 TraceCheckUtils]: 83: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,883 INFO L290 TraceCheckUtils]: 84: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,883 INFO L290 TraceCheckUtils]: 85: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} assume 8656 == #t~mem77;havoc #t~mem77; {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} is VALID [2022-04-28 15:36:22,884 INFO L290 TraceCheckUtils]: 86: Hoare triple {177519#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (not (= ssl3_accept_~s.base (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 248)))))} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 248 + ~s.offset, 8);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 888 + #t~mem141.offset, 8);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 192 + #t~mem140.offset, 8);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,884 INFO L290 TraceCheckUtils]: 87: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,884 INFO L290 TraceCheckUtils]: 88: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,885 INFO L290 TraceCheckUtils]: 89: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,886 INFO L290 TraceCheckUtils]: 90: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == ~tmp___10~0); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,886 INFO L290 TraceCheckUtils]: 91: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,886 INFO L290 TraceCheckUtils]: 92: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} ~skip~0 := 0; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,887 INFO L290 TraceCheckUtils]: 94: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !false; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,887 INFO L290 TraceCheckUtils]: 95: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,888 INFO L290 TraceCheckUtils]: 96: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,888 INFO L290 TraceCheckUtils]: 97: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,891 INFO L290 TraceCheckUtils]: 104: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,891 INFO L290 TraceCheckUtils]: 105: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,892 INFO L290 TraceCheckUtils]: 106: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,892 INFO L290 TraceCheckUtils]: 107: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,892 INFO L290 TraceCheckUtils]: 108: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,893 INFO L290 TraceCheckUtils]: 109: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,893 INFO L290 TraceCheckUtils]: 110: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,893 INFO L290 TraceCheckUtils]: 111: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,894 INFO L290 TraceCheckUtils]: 112: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,894 INFO L290 TraceCheckUtils]: 113: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,895 INFO L290 TraceCheckUtils]: 114: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,895 INFO L290 TraceCheckUtils]: 115: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,895 INFO L290 TraceCheckUtils]: 116: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,896 INFO L290 TraceCheckUtils]: 117: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,896 INFO L290 TraceCheckUtils]: 118: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,896 INFO L290 TraceCheckUtils]: 119: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,897 INFO L290 TraceCheckUtils]: 120: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,897 INFO L290 TraceCheckUtils]: 121: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,898 INFO L290 TraceCheckUtils]: 122: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,898 INFO L290 TraceCheckUtils]: 123: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,898 INFO L290 TraceCheckUtils]: 124: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,899 INFO L290 TraceCheckUtils]: 125: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,899 INFO L290 TraceCheckUtils]: 126: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,899 INFO L290 TraceCheckUtils]: 127: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 72 + ~s.offset, 4); {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,900 INFO L290 TraceCheckUtils]: 128: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 8672 == #t~mem79;havoc #t~mem79; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,900 INFO L290 TraceCheckUtils]: 129: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,900 INFO L290 TraceCheckUtils]: 130: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} is VALID [2022-04-28 15:36:22,901 INFO L290 TraceCheckUtils]: 131: Hoare triple {177520#(not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base))} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 72 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 128 + ~s.offset, 4); {177521#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} is VALID [2022-04-28 15:36:22,902 INFO L290 TraceCheckUtils]: 132: Hoare triple {177521#(and (not (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ 116 ssl3_accept_~s.offset)) ssl3_accept_~s.base)) (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72))))} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call write~int(8640, #t~mem146.base, 904 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,902 INFO L290 TraceCheckUtils]: 133: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call write~int(0, ~s.base, 88 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,903 INFO L290 TraceCheckUtils]: 134: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem151 := read~int(#t~mem150.base, 908 + #t~mem150.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,903 INFO L290 TraceCheckUtils]: 135: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,904 INFO L290 TraceCheckUtils]: 136: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} ~skip~0 := 0; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,904 INFO L290 TraceCheckUtils]: 137: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !false; {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,904 INFO L290 TraceCheckUtils]: 138: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} call #t~mem46 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,905 INFO L290 TraceCheckUtils]: 139: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,905 INFO L290 TraceCheckUtils]: 140: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,905 INFO L290 TraceCheckUtils]: 141: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,906 INFO L290 TraceCheckUtils]: 142: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,906 INFO L290 TraceCheckUtils]: 143: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,906 INFO L290 TraceCheckUtils]: 144: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,907 INFO L290 TraceCheckUtils]: 145: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,907 INFO L290 TraceCheckUtils]: 146: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,908 INFO L290 TraceCheckUtils]: 147: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,908 INFO L290 TraceCheckUtils]: 148: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,908 INFO L290 TraceCheckUtils]: 149: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,909 INFO L290 TraceCheckUtils]: 150: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,909 INFO L290 TraceCheckUtils]: 151: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,909 INFO L290 TraceCheckUtils]: 152: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,910 INFO L290 TraceCheckUtils]: 153: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,910 INFO L290 TraceCheckUtils]: 154: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,910 INFO L290 TraceCheckUtils]: 155: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,911 INFO L290 TraceCheckUtils]: 156: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,911 INFO L290 TraceCheckUtils]: 157: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 158: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 72 + ~s.offset, 4); {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 159: Hoare triple {177522#(= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 72)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 72 + ~s.offset, 4); {177523#(= 8448 |ssl3_accept_#t~mem68|)} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 160: Hoare triple {177523#(= 8448 |ssl3_accept_#t~mem68|)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 161: Hoare triple {177512#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 162: Hoare triple {177512#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 163: Hoare triple {177512#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,912 INFO L290 TraceCheckUtils]: 164: Hoare triple {177512#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,913 INFO L290 TraceCheckUtils]: 165: Hoare triple {177512#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,913 INFO L290 TraceCheckUtils]: 166: Hoare triple {177512#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 72 + ~s.offset, 4); {177512#false} is VALID [2022-04-28 15:36:22,913 INFO L290 TraceCheckUtils]: 167: Hoare triple {177512#false} assume 8640 == #t~mem75;havoc #t~mem75; {177512#false} is VALID [2022-04-28 15:36:22,913 INFO L290 TraceCheckUtils]: 168: Hoare triple {177512#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {177512#false} is VALID [2022-04-28 15:36:22,913 INFO L290 TraceCheckUtils]: 169: Hoare triple {177512#false} assume 4 == ~blastFlag~0; {177512#false} is VALID [2022-04-28 15:36:22,913 INFO L290 TraceCheckUtils]: 170: Hoare triple {177512#false} assume !false; {177512#false} is VALID [2022-04-28 15:36:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 15:36:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 15:36:22,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949838476] [2022-04-28 15:36:22,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949838476] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 15:36:22,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315112143] [2022-04-28 15:36:22,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 15:36:22,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 15:36:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 15:36:22,916 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:36:22,918 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:37:00,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 15:37:00,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 15:37:01,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 232 conjunts are in the unsatisfiable core [2022-04-28 15:37:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 15:37:01,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 15:37:02,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-28 15:37:02,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82930 treesize of output 60431 [2022-04-28 15:37:02,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-28 15:37:02,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22065 treesize of output 5278 [2022-04-28 15:41:16,907 INFO L244 Elim1Store]: Index analysis took 238 ms [2022-04-28 15:41:20,434 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 15:41:20,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 15:41:20,659 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,SelfDestructingSolverStorable36 [2022-04-28 15:41:20,660 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_4 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java: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:41:20,662 INFO L158 Benchmark]: Toolchain (without parser) took 674292.61ms. Allocated memory was 177.2MB in the beginning and 921.7MB in the end (delta: 744.5MB). Free memory was 154.0MB in the beginning and 716.4MB in the end (delta: -562.4MB). Peak memory consumption was 657.7MB. Max. memory is 8.0GB. [2022-04-28 15:41:20,662 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 15:41:20,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.84ms. Allocated memory is still 177.2MB. Free memory was 153.7MB in the beginning and 127.3MB in the end (delta: 26.4MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2022-04-28 15:41:20,662 INFO L158 Benchmark]: Boogie Preprocessor took 111.84ms. Allocated memory is still 177.2MB. Free memory was 127.3MB in the beginning and 117.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 15:41:20,662 INFO L158 Benchmark]: RCFGBuilder took 1332.66ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 117.2MB in the beginning and 103.7MB in the end (delta: 13.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2022-04-28 15:41:20,662 INFO L158 Benchmark]: TraceAbstraction took 672371.32ms. Allocated memory was 212.9MB in the beginning and 921.7MB in the end (delta: 708.8MB). Free memory was 103.2MB in the beginning and 716.4MB in the end (delta: -613.2MB). Peak memory consumption was 571.6MB. Max. memory is 8.0GB. [2022-04-28 15:41:20,663 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.13ms. Allocated memory is still 177.2MB. Free memory is still 143.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.84ms. Allocated memory is still 177.2MB. Free memory was 153.7MB in the beginning and 127.3MB in the end (delta: 26.4MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 111.84ms. Allocated memory is still 177.2MB. Free memory was 127.3MB in the beginning and 117.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 1332.66ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 117.2MB in the beginning and 103.7MB in the end (delta: 13.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 672371.32ms. Allocated memory was 212.9MB in the beginning and 921.7MB in the end (delta: 708.8MB). Free memory was 103.2MB in the beginning and 716.4MB in the end (delta: -613.2MB). Peak memory consumption was 571.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_4: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:285) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 15:41:20,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...